-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day_051.cpp
58 lines (44 loc) · 912 Bytes
/
Day_051.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/**
*Problem Statement: Given an integer array of size N, write a program to sort the array.
*Author: Kunal Kathpal (https://github.com/kunal-2002)
*/
#include <bits/stdc++.h>
using namespace std;
//Quick Sort Method
int partition(int arr[], int low, int high){
int pivot = arr[high];
int i = (low - 1);
for(int j = low; j <= high; j++){
if(arr[j] < pivot){
i++;
swap(arr[i], arr[j]);
}
}
swap(arr[i+1], arr[high]);
return (i+1);
}
void quickSort(int arr[], int low, int high){
if(low<high){
int pi = partition(arr, low, high);
quickSort(arr, low, pi-1);
quickSort(arr, pi+1, high);
}
}
int main(){
cout<<"Enter number of test cases:\t";
int T;
cin>>T;
while(T--){
int n;
cin>>n;
int arr[n];
for(int i=0; i<n; i++){
cin>>arr[i];
}
quickSort(arr, 0, n-1);
for(int i = 0; i<n; i++)
cout<< arr[i]<<" ";
cout<<endl;
}
return 0;
}