From 2b45e203316cb470ec5bd80fe03fc676765b8c75 Mon Sep 17 00:00:00 2001
From: SamraatBansal <55536657+SamraatBansal@users.noreply.github.com>
Date: Thu, 1 Oct 2020 16:06:27 +0530
Subject: [PATCH] Create Quick Sort

Added the complete running code of quick sort using recursion
---
 Quick Sort | 66 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 Quick Sort

diff --git a/Quick Sort b/Quick Sort
new file mode 100644
index 0000000..42b75f5
--- /dev/null
+++ b/Quick Sort	
@@ -0,0 +1,66 @@
+#include<iostream>
+using namespace std;
+
+int partition(int arr[], int si, int ei)
+{
+  int count =0;
+  for(int i=0; i<=ei; i++)
+  {
+    if(arr[i]<arr[si])
+    {
+      count++;
+    }
+  }
+  int temp = arr[si];
+  arr[si]= arr[count];
+  arr[count]=temp;
+
+  while(si<ei)
+  {
+    if(arr[si]<arr[count])
+    {
+      si++;
+    }
+    else if(arr[ei]>=arr[count])
+    {
+      ei--;
+    }
+    else
+    {
+      int temp2= arr[si];
+      arr[si]=arr[ei];
+      arr[ei]=temp2;
+      si++;ei--;
+    }
+  }
+  return count;
+}
+
+void quicksort(int arr[], int si, int ei)
+{
+  if(si>=ei)
+  {
+    return;
+  }
+  int c = partition(arr, si, ei);
+  quicksort(arr, si, c-1);
+  quicksort(arr, c+1, ei);
+}
+int main()
+{
+  cout<<"Enter  Array size"<<endl;
+  int n;
+  cin>>n;
+  int arr[n];
+  for(int i=0; i<n; i++)
+  {
+    cin>>arr[i];
+  }
+  int si=0, ei=n-1;
+  quicksort(arr,si, ei);
+
+  for(int i=0; i<n; i++)
+  {
+    cout<<arr[i]<<" ";
+  }
+}