Quick Sort

Author: 8h

src/main/java/com/algorithms/sort/QuickSort.java

@@ -5,7 +5,6 @@ public class QuickSort {
     public static void main(String[] args) {
 
         int[] array = {10,8,100,3,5,2,1,10};
-        QuickSort quickSort = new QuickSort();
         quickSort(array, 0, array.length-1);
 
         for(int i=0; i< array.length; i++) {
@@ -54,5 +53,40 @@ public static void quickSort(int[] array, int low, int high) {
 
     }
 
+    public static void quickSortRecursive(int[] array, int low, int high) {
+
+        if(low > high) {
+            return;
+        }
+
+        int partitionIndex = partition(array, low, high);
+        quickSortRecursive(array, low, partitionIndex-1);
+        quickSortRecursive(array, partitionIndex+1, high);
+
+    }
+
+    public static int partition(int[] array, int low, int high) {
+
+        int pivot = array[high];
+        int index = low-1;
+
+        for(int i=low; i<high; i++) {
+
+            if(array[i] <= pivot) {
+                index++;
+                int temp = array[i];
+                array[i] = array[index];
+                array[index] = temp;
+            }
+
+        }
+
+        int temp = array[index+1];
+        array[index+1] = array[high];
+        array[high] = temp;
+
+        return index+1;
+    }
+
 
 }