From 5c6d4d98e62e7de8184d587cd6fc351c4eb12bde Mon Sep 17 00:00:00 2001
From: niteshnanda02 <niteshnanda02@gmail.com>
Date: Sun, 7 Oct 2018 20:36:47 +0530
Subject: [PATCH 1/2] quicksort updated

---
 2-Sorting/Quicksort.java | 43 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 2-Sorting/Quicksort.java

diff --git a/2-Sorting/Quicksort.java b/2-Sorting/Quicksort.java
new file mode 100644
index 0000000..3b01dc0
--- /dev/null
+++ b/2-Sorting/Quicksort.java
@@ -0,0 +1,43 @@
+import java.util.Arrays;
+
+import static java.util.Arrays.sort;
+
+public class Quicksort {
+    public static void main(String[] args) {
+        int[] nums = {5, 2, 1, 6, 9, 3};
+
+        sort(nums, 0, nums.length - 1);
+        System.out.println(Arrays.toString(nums));
+    }
+
+    private static void sort(int[] nums, int start, int end) {
+        if (start>=end){
+            return;
+        }
+        int p = end;
+        p = pivot(nums, start, end, p);
+        sort(nums,start,p-1);
+        sort(nums,p+1,end);
+
+    }
+
+    private static int pivot(int[] nums, int start, int end, int p) {
+        int j= start;
+        for (int i = start; i <end ; i++) {
+            if (nums[i]<nums[p]){
+                swap(nums,i,j);
+                j++;
+            }
+        }
+        swap(nums,j,p);
+        return j;
+
+    }
+
+    private static void swap(int[] nums, int i, int j) {
+        int temp = nums[j];
+        nums[j]=nums[i];
+        nums[i]=temp;
+    }
+
+}

From 2379bd94d7162184db2252406067ba2570ae6fc6 Mon Sep 17 00:00:00 2001
From: niteshnanda02 <niteshnanda02@gmail.com>
Date: Sun, 7 Oct 2018 20:38:00 +0530
Subject: [PATCH 2/2] quicksort update

---
 Quicksort.java | 43 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 Quicksort.java

diff --git a/Quicksort.java b/Quicksort.java
new file mode 100644
index 0000000..3b01dc0
--- /dev/null
+++ b/Quicksort.java
@@ -0,0 +1,43 @@
+import java.util.Arrays;
+
+import static java.util.Arrays.sort;
+
+public class Quicksort {
+    public static void main(String[] args) {
+        int[] nums = {5, 2, 1, 6, 9, 3};
+
+        sort(nums, 0, nums.length - 1);
+        System.out.println(Arrays.toString(nums));
+    }
+
+    private static void sort(int[] nums, int start, int end) {
+        if (start>=end){
+            return;
+        }
+        int p = end;
+        p = pivot(nums, start, end, p);
+        sort(nums,start,p-1);
+        sort(nums,p+1,end);
+
+    }
+
+    private static int pivot(int[] nums, int start, int end, int p) {
+        int j= start;
+        for (int i = start; i <end ; i++) {
+            if (nums[i]<nums[p]){
+                swap(nums,i,j);
+                j++;
+            }
+        }
+        swap(nums,j,p);
+        return j;
+
+    }
+
+    private static void swap(int[] nums, int i, int j) {
+        int temp = nums[j];
+        nums[j]=nums[i];
+        nums[i]=temp;
+    }
+
+}