From ba5c6a52e07aca15080cb2192cc9f7f6e233517c Mon Sep 17 00:00:00 2001
From: arpita938 <70204047+arpita938@users.noreply.github.com>
Date: Wed, 14 Oct 2020 20:04:31 +0530
Subject: [PATCH] Create Quick Sort

quick sort
---
 Quick Sort | 47 +++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 47 insertions(+)
 create mode 100644 Quick Sort

diff --git a/Quick Sort b/Quick Sort
new file mode 100644
index 0000000..802adfc
--- /dev/null
+++ b/Quick Sort	
@@ -0,0 +1,47 @@
+#include <stdio.h>
+#include<stdlib.h>
+void swap(int *x,int *y)
+{
+ int temp=*x;
+ *x=*y;
+ *y=temp;
+}
+int partition(int A[],int l,int h)
+{
+ int pivot=A[l];
+ int i=l,j=h;
+
+ do
+ {
+ do{i++;}while(A[i]<=pivot);
+ do{j--;}while(A[j]>pivot);
+
+ if(i<j)swap(&A[i],&A[j]);
+ }while(i<j);
+
+ swap(&A[l],&A[j]);
+ return j;
+}
+void QuickSort(int A[],int l,int h)
+{
+ int j;
+
+ if(l<h)
+ {
+ j=partition(A,l,h);
+ QuickSort(A,l,j);
+ QuickSort(A,j+1,h);
+ }
+}
+int main()
+{
+ int A[]={11,13,7,12,16,9,24,5,10,3},n=10,i;
+
+ QuickSort(A,n);
+
+ for(i=0;i<10;i++)
+ printf("%d ",A[i]);
+ printf("\n");
+
+ return 0;
+}