quicksort.md

Quicksort

public static void quickSort(int[] array) {
   quickSort(array, 0, array.length - 1);
}

private static void quickSort(int[] arr, int begin, int end) {
   if (begin < end) {
       int partitionIndex = partition(arr, begin, end);
       quickSort(arr, begin, partitionIndex - 1);
       quickSort(arr, partitionIndex + 1, end);
   }
}

private static int partition(int[] array, int left, int right) {
   int pivot = array[right], i = left - 1;
   for (int j = left ; j < right ; j++) {
       if (array[j] < pivot) {
           i++;
           swap(array, i, j);
       }
   }
   swap(array, i + 1, right);
   return i + 1;
}

private static void swap(int[] array, int i, int j) {
   int temp = array[i];
   array[i] = array[j];
   array[j] = temp;
}