From b943f5942f696659f64dabd4b3db03e456fdaca1 Mon Sep 17 00:00:00 2001
From: Rama Shanker Singh <32456359+rama0804@users.noreply.github.com>
Date: Mon, 8 Oct 2018 01:35:36 +0530
Subject: [PATCH] Create quick_sort.cpp

Program for Quick sort in C++
---
 Sorting_Algorithms/Quick_sort/quick_sort.cpp | 68 ++++++++++++++++++++
 1 file changed, 68 insertions(+)
 create mode 100644 Sorting_Algorithms/Quick_sort/quick_sort.cpp

diff --git a/Sorting_Algorithms/Quick_sort/quick_sort.cpp b/Sorting_Algorithms/Quick_sort/quick_sort.cpp
new file mode 100644
index 0000000..1805a93
--- /dev/null
+++ b/Sorting_Algorithms/Quick_sort/quick_sort.cpp
@@ -0,0 +1,68 @@
+#include <iostream>
+ 
+using namespace std;
+ 
+void quick_sort(int[],int,int);
+int partition(int[],int,int);
+ 
+int main()
+{
+    int a[50],n,i;
+    cout<<"How many elements?";
+    cin>>n;
+    cout<<"\nEnter array elements:";
+    
+    for(i=0;i<n;i++)
+        cin>>a[i];
+        
+    quick_sort(a,0,n-1);
+    cout<<"\nArray after sorting:";
+    
+    for(i=0;i<n;i++)
+        cout<<a[i]<<" ";
+    
+    return 0;        
+}
+ 
+void quick_sort(int a[],int l,int u)
+{
+    int j;
+    if(l<u)
+    {
+        j=partition(a,l,u);
+        quick_sort(a,l,j-1);
+        quick_sort(a,j+1,u);
+    }
+}
+ 
+int partition(int a[],int l,int u)
+{
+    int v,i,j,temp;
+    v=a[l];
+    i=l;
+    j=u+1;
+    
+    do
+    {
+        do
+            i++;
+            
+        while(a[i]<v&&i<=u);
+        
+        do
+            j--;
+        while(v<a[j]);
+        
+        if(i<j)
+        {
+            temp=a[i];
+            a[i]=a[j];
+            a[j]=temp;
+        }
+    }while(i<j);
+    
+    a[l]=a[j];
+    a[j]=v;
+    
+    return(j);
+}