From 49508b43456df398f5cb406c08ef75e3679896fd Mon Sep 17 00:00:00 2001
From: Krish Munot <krishmunot@gmail.com>
Date: Sun, 13 Dec 2020 01:49:54 +0530
Subject: [PATCH] Revert "10.Quicksort.cpp (#70)"

This reverts commit 27f75147a129c014962747c48ae60e988443242a.
---
 Ch 1.Arrays And Strings/10.Ouicksort.cpp | 66 ------------------------
 1 file changed, 66 deletions(-)
 delete mode 100644 Ch 1.Arrays And Strings/10.Ouicksort.cpp

diff --git a/Ch 1.Arrays And Strings/10.Ouicksort.cpp b/Ch 1.Arrays And Strings/10.Ouicksort.cpp
deleted file mode 100644
index 6e16e08..0000000
--- a/Ch 1.Arrays And Strings/10.Ouicksort.cpp	
+++ /dev/null
@@ -1,66 +0,0 @@
-#include <iostream>
-using namespace std;
-
-int partition(int *arr,int low,int high);
-
-void quick(int *arr,int low,int high){
-if(high>low){
-int cnst=partition(arr,low,high);
-quick(arr,low,cnst-1);
-quick(arr,cnst+1,high);
-}
-}
-
-int partition(int *arr,int low,int high){
-int pivot=arr[low];
-int i=low,j=high+1;
-
-while(i<j){
-
-do{
-i++;
-}
-while(arr[i]<=pivot);
-
-do{
-j--;
-}
-while(arr[j]>pivot);
-
-if(i<j){
-int tmp=arr[i];
-arr[i]=arr[j];
-arr[j]=tmp;
-}
-
-}
-
-int tmp=arr[low];
-arr[low]=arr[j];
-arr[j]=tmp;
-
-/*for(int i=low;i<=high;i++)
-cout<<arr[i]<<" ";
-cout<<endl;*/
-
-return j;
-}
-
-int main(){
-
-int n;
-cout<<"Enter array size "<<endl;
-cin>>n;
-
-int arr[n];
-cout<<"Enter array elements "<<endl;
-
-for(int i=0;i<n;i++)
-cin>>arr[i];
-
-quick(arr,0,n-1);
-for(int i=0;i<n;i++)
-cout<<arr[i]<<" ";
-cout<<endl;
-
-}