From c7aa1e57e95b568933d9d1b7c6a08c253815d0cd Mon Sep 17 00:00:00 2001
From: Mujeeb-shaikh7 <84932558+Mujeeb-shaikh7@users.noreply.github.com>
Date: Fri, 1 Oct 2021 16:06:33 +0530
Subject: [PATCH] Create quick sort

---
 C++/Algorithms/quick sort | 47 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 47 insertions(+)
 create mode 100644 C++/Algorithms/quick sort

diff --git a/C++/Algorithms/quick sort b/C++/Algorithms/quick sort
new file mode 100644
index 00000000..6cd30d7c
--- /dev/null
+++ b/C++/Algorithms/quick sort	
@@ -0,0 +1,47 @@
+#include <iostream>
+using namespace std;
+void swap(int a[],int i,int j){
+    int t=a[i];
+    a[i]=a[j];
+    a[j]=t;
+}
+int partition(int a[],int l,int r){
+    int i=l-1;
+    
+    int pivot=a[r];
+    for(int j=l;j<r;j++){
+        if(a[j]<pivot){
+            i++;
+            swap(a,i,j);
+        }
+    }
+    swap(a,i+1,r);
+    return i+1;
+}
+
+void quicksort(int arr[],int l,int r){
+    if(l<r){
+    int pi=partition(arr,l,r);
+    quicksort(arr,l,pi-1);
+    quicksort(arr,pi+1,r);
+    }
+    
+}
+
+int main() {
+    int arr[100],n;
+cout<<"Enter the  number of elements in an array";
+cin>>n;
+cout<<"Enter the elements in an array"<<endl;
+ for(int i=0;i<n;i++)
+ {
+    cin>>arr[i];
+}
+    quicksort(arr,0,n);
+  cout<<"the sorted array using quicksort is"<<endl;
+    for(int j=0;j<5;j++){
+        cout<<arr[j]<<" ";
+    }
+
+    return 0;
+}