From 19b78592d5d12006fa8c19d43c4909aa98b73a83 Mon Sep 17 00:00:00 2001
From: ROHIT SHARMA <r0s03ok@homeoffice.wal-mart.com>
Date: Fri, 2 Oct 2020 14:36:06 +0530
Subject: [PATCH] in place quicksort

---
 in-place quicksort.txt | 59 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 59 insertions(+)
 create mode 100644 in-place quicksort.txt

diff --git a/in-place quicksort.txt b/in-place quicksort.txt
new file mode 100644
index 0000000..d9ef8da
--- /dev/null
+++ b/in-place quicksort.txt	
@@ -0,0 +1,59 @@
+// in-place quicksort... also called  Lomuto Partitioning method.
+// here the last element is taken as the pivot element 
+// also, in the output, the array is printed after every successful partition 
+
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+#include <stdlib.h>
+
+void display(int n, int *a)
+    {
+    for(int i=0;i<n;i++)
+        printf("%d ",a[i]);
+    printf("\n");
+}
+int partition(int p,int q,int n,int *a)
+    {
+    int x=a[q],temp;
+    int i=p,j=p;
+    while(j<q)
+        {
+        if(a[j]<x)
+            {
+            temp=a[i];
+            a[i]=a[j];
+            a[j]=temp;
+            i++;
+        }
+        j++;
+    }
+    temp=a[q];
+    a[q]=a[i];
+    a[i]=temp; 
+    return i;
+}
+void quicksort(int p,int q, int n,int *a) {
+   if(p>=q)
+       return;
+    else
+        {
+        int m;
+        m=partition(p,q,n,a);
+        display(n,a);
+        quicksort(p,m-1,n,a);
+        quicksort(m+1,q,n,a);
+    }
+}
+int main(void) {
+   int ar_size;
+   scanf("%d", &ar_size);
+   int ar[ar_size], i;
+   for(i = 0; i < ar_size; i++) { 
+      scanf("%d", &ar[i]); 
+   }
+  
+   quicksort(0,ar_size-1,ar_size, ar);
+   
+   return 0;
+}