From dfad2ee332dcd2e10a1ef107aed81a4dd867fac7 Mon Sep 17 00:00:00 2001
From: Roshan Prakash Raut <roshanpk.raut@gmail.com>
Date: Thu, 1 Oct 2020 17:08:53 +0530
Subject: [PATCH 1/2] Added Quick sort algorithm in C++ .

---
 Sorting/quick_sort/quick_sort.cpp.cpp | 96 +++++++++++++++++++++++++++
 1 file changed, 96 insertions(+)
 create mode 100644 Sorting/quick_sort/quick_sort.cpp.cpp

diff --git a/Sorting/quick_sort/quick_sort.cpp.cpp b/Sorting/quick_sort/quick_sort.cpp.cpp
new file mode 100644
index 0000000..fb1e99d
--- /dev/null
+++ b/Sorting/quick_sort/quick_sort.cpp.cpp
@@ -0,0 +1,96 @@
+/*
+QUICK SORT ALGORITHM : 	TIME COMPLEXITY O(nlogn(n))
+
+*/
+
+
+#include<iostream>
+using namespace std;
+
+//note: call by address in swap function 
+void swap(int *a,int *b)
+{
+	int t;
+	t=*a;
+	*a=*b;
+	*b=t;
+}
+
+
+//partition function which makes partition in array and return the partition index
+int partition(int a[],int low ,int high)
+{
+	// i is leftmost index and j is the rightmost index
+	int i = low,j = high;     
+	int pivot = a[low];     
+	
+	
+	do{
+		do
+		{
+		  i++;		
+		}while(a[i]<=pivot);  //note :condition is for continuation of loop ans not for stop
+		
+		do
+		{
+			j--;
+		}while(a[j]>pivot);   // note: condition is for continuation of loop and not for stop
+		
+		
+		if(i<j)              // note: condition
+			swap(&a[i],&a[j]);  // note:
+			
+	}while(i<j);              //note:condition
+	
+	swap(&a[low],&a[j]); //note:
+    
+	return j;  
+}
+
+
+//Quick sort function
+void Quick_sort(int a[],int low,int high)
+{
+	int j; // j is partition index
+	
+	 //note: This condition for says that min two elements are required for quick sort
+	if(low < high)          
+	{
+		//index j is partition index 
+		j = partition(a,low,high) ;  
+		
+		// left partition  // note: low to j is for left partition
+		Quick_sort(a,low,j);       
+		
+		//right partition    //note: j+1 to high is for right partition
+		Quick_sort(a,j+1,high);  
+		
+	}
+}
+
+
+//main function
+int main(){
+	
+	int arr[]= {2,4,3,6,9,8, -1};	
+	int n = sizeof(arr)/sizeof(arr[0]);
+		
+	cout<<"Before Quick Sort array is : ";
+	for(int i=0;i<n;i++){
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	
+	//Quick sort
+	Quick_sort(arr,0,n);
+	
+	cout<<"After Quick Sort array is : ";
+	for(int i=0;i<n;i++){
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+}
+
+
+
+

From 1ff97c9d76737828321daa4ea13dfd2d6d5eb0cc Mon Sep 17 00:00:00 2001
From: Roshan Prakash Raut <roshanpk.raut@gmail.com>
Date: Sat, 3 Oct 2020 01:04:12 +0530
Subject: [PATCH 2/2] Custom array input added and file name corrected

---
 Sorting/bucket_sort/quick_sort.cpp            | 106 ++++++++++++++++++
 .../{quick_sort.cpp.cpp => quick_sort.cpp}    |  14 ++-
 2 files changed, 118 insertions(+), 2 deletions(-)
 create mode 100644 Sorting/bucket_sort/quick_sort.cpp
 rename Sorting/quick_sort/{quick_sort.cpp.cpp => quick_sort.cpp} (92%)

diff --git a/Sorting/bucket_sort/quick_sort.cpp b/Sorting/bucket_sort/quick_sort.cpp
new file mode 100644
index 0000000..7febd93
--- /dev/null
+++ b/Sorting/bucket_sort/quick_sort.cpp
@@ -0,0 +1,106 @@
+/*
+QUICK SORT ALGORITHM : 	TIME COMPLEXITY O(nlogn(n))
+
+*/
+
+
+#include<iostream>
+using namespace std;
+
+//note: call by address in swap function 
+void swap(int *a,int *b)
+{
+	int t;
+	t=*a;
+	*a=*b;
+	*b=t;
+}
+
+
+//partition function which makes partition in array and return the partition index
+int partition(int a[],int low ,int high)
+{
+	// i is leftmost index and j is the rightmost index
+	int i = low,j = high;     
+	int pivot = a[low];     
+	
+	
+	do{
+		do
+		{
+		  i++;		
+		}while(a[i]<=pivot);  //note :condition is for continuation of loop ans not for stop
+		
+		do
+		{
+			j--;
+		}while(a[j]>pivot);   // note: condition is for continuation of loop and not for stop
+		
+		
+		if(i<j)              // note: condition
+			swap(&a[i],&a[j]);  // note:
+			
+	}while(i<j);              //note:condition
+	
+	swap(&a[low],&a[j]); //note:
+    
+	return j;  
+}
+
+
+//Quick sort function
+void Quick_sort(int a[],int low,int high)
+{
+	int j; // j is partition index
+	
+	 //note: This condition for says that min two elements are required for quick sort
+	if(low < high)          
+	{
+		//index j is partition index 
+		j = partition(a,low,high) ;  
+		
+		// left partition  // note: low to j is for left partition
+		Quick_sort(a,low,j);       
+		
+		//right partition    //note: j+1 to high is for right partition
+		Quick_sort(a,j+1,high);  
+		
+	}
+}
+
+
+//main function
+int main(){
+	
+	int n;
+	
+	//Enter the number of elements in array
+	cin>>n;
+	
+	int arr[n];
+	
+	//input the custom array 
+	for(int i=0;i<n;i++){
+		cin>>arr[i];
+	}
+	
+		
+	cout<<"Before Quick Sort array is : ";
+	for(int i=0;i<n;i++){
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+	
+	//Quick sort
+	Quick_sort(arr,0,n);
+	
+	cout<<"After Quick Sort array is : ";
+	for(int i=0;i<n;i++){
+		cout<<arr[i]<<" ";
+	}
+	cout<<endl;
+}
+
+
+
+
diff --git a/Sorting/quick_sort/quick_sort.cpp.cpp b/Sorting/quick_sort/quick_sort.cpp
similarity index 92%
rename from Sorting/quick_sort/quick_sort.cpp.cpp
rename to Sorting/quick_sort/quick_sort.cpp
index fb1e99d..6c10e86 100644
--- a/Sorting/quick_sort/quick_sort.cpp.cpp
+++ b/Sorting/quick_sort/quick_sort.cpp
@@ -72,8 +72,18 @@ void Quick_sort(int a[],int low,int high)
 //main function
 int main(){
 	
-	int arr[]= {2,4,3,6,9,8, -1};	
-	int n = sizeof(arr)/sizeof(arr[0]);
+	int n;
+	
+	// n - number of inputs
+	cin>>n;
+	
+	int arr[n];
+	
+	//input the custom array 
+	for(int i=0;i<n;i++){
+		cin>>arr[i];
+	}
+	
 		
 	cout<<"Before Quick Sort array is : ";
 	for(int i=0;i<n;i++){