From 54b5c8c4a212997a4956c2f6d6caeba9b26b12eb Mon Sep 17 00:00:00 2001
From: MJ-1004 <116111723+MJ-1004@users.noreply.github.com>
Date: Wed, 19 Oct 2022 00:12:37 +0530
Subject: [PATCH] Create Quick_sort.cpp

---
 Quick_sort.cpp | 56 ++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 Quick_sort.cpp

diff --git a/Quick_sort.cpp b/Quick_sort.cpp
new file mode 100644
index 0000000..7693459
--- /dev/null
+++ b/Quick_sort.cpp
@@ -0,0 +1,56 @@
+#include <bits/stdc++.h>
+using namespace std;
+  
+void swap(int* a, int* b)
+{
+    int t = *a;
+    *a = *b;
+    *b = t;
+}
+  
+int partition(int arr[], int low, int high)
+{
+    int pivot = arr[high]; // pivot
+    int i = (low - 1); 
+    for (int j = low; j <= high - 1; j++) {
+        if (arr[j] < pivot) {
+            i++; 
+            swap(&arr[i], &arr[j]);
+        }
+    }
+    swap(&arr[i + 1], &arr[high]);
+    return (i + 1);
+}
+  
+arr[] --> Array to be sorted,
+low --> Starting index,
+high --> Ending index */
+void quickSort(int arr[], int low, int high)
+{
+    if (low < high) {
+        /* pi is partitioning index, arr[p] is now
+        at right place */
+        int pi = partition(arr, low, high);
+  
+        quickSort(arr, low, pi - 1);
+        quickSort(arr, pi + 1, high);
+    }
+}
+  
+void printArray(int arr[], int size)
+{
+    int i;
+    for (i = 0; i < size; i++)
+        cout << arr[i] << " ";
+    cout << endl;
+}
+  
+int main()
+{
+    int arr[] = { 211, 17, 18, 532, 1, 1235 };
+    int n = sizeof(arr) / sizeof(arr[0]);
+    quickSort(arr, 0, n - 1);
+    cout << "Sorted array: \n";
+    printArray(arr, n);
+    return 0;
+}