From 62ff57d66edad21a113c4924b44cd4f9238721f1 Mon Sep 17 00:00:00 2001
From: AnonyMousBoy511 <56958482+AnonyMousBoy511@users.noreply.github.com>
Date: Thu, 24 Oct 2019 15:30:02 +0530
Subject: [PATCH] Adding QuickSort algo for hacktoberfest

---
 sorting/Quick_Sort.java | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 sorting/Quick_Sort.java

diff --git a/sorting/Quick_Sort.java b/sorting/Quick_Sort.java
new file mode 100644
index 0000000..50a9888
--- /dev/null
+++ b/sorting/Quick_Sort.java
@@ -0,0 +1,25 @@
+static int partition(int[] array, int begin, int end) {
+    int pivot = end;
+
+    int counter = begin;
+    for (int i = begin; i < end; i++) {
+        if (array[i] < array[pivot]) {
+            int temp = array[counter];
+            array[counter] = array[i];
+            array[i] = temp;
+            counter++;
+        }
+    }
+    int temp = array[pivot];
+    array[pivot] = array[counter];
+    array[counter] = temp;
+
+    return counter;
+}
+
+public static void quickSort(int[] array, int begin, int end) {
+    if (end <= begin) return;
+    int pivot = partition(array, begin, end);
+    quickSort(array, begin, pivot-1);
+    quickSort(array, pivot+1, end);
+}