Merge pull request #1 from Aishwary2004Gupta/Aishwary2004Gupta-patch-1

QuickSort.java

Author: Aishwary2004Gupta

QuickSort.java

@@ -0,0 +1,39 @@
+public class quickSort {
+    public static void main(String[] args) {
+        int[] arr = {5,6,4,2,6,1,0};
+        sort(arr, 0, arr.length-1);
+        System.out.println(Arrays.toString(arr));
+
+    }
+
+
+    static void sort(int[] nums, int low, int high) {
+        if (low >= high){
+            return;
+        }
+
+        int start = low;
+        int end = high;
+        int mid = start + (end - start)/2;
+        int pivot = nums[mid]; //contains the value
+
+        while (start <= end){
+            while (nums[start] < pivot){
+                start++;
+            }
+            while (nums[end] >pivot){
+                end--;
+            }
+
+            if (start <= end){
+                int temp = nums[start];
+                nums[start] = nums[end];
+                nums[end] = temp;
+                start++;
+                end--;
+            }
+        }
+        sort(nums, low, end);
+        sort(nums, start, high);
+    }
+}