-
Notifications
You must be signed in to change notification settings - Fork 57
/
quicksort.cpp
62 lines (58 loc) · 1.24 KB
/
quicksort.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
59
60
61
62
#include<bits/stdc++.h>
using namespace std;
int partition(int *a,int start,int end)
{
int pivot=a[end];
//pivot value index
int P_index=start;
int i,t; //t is temporary variable
//Here we will check if array value is
//less than pivot
//then we will place it at left side
//by swapping
for(i=start;i<end;i++)
{
if(a[i]<=pivot)
{
t=a[i];
a[i]=a[P_index];
a[P_index]=t;
P_index++;
}
}
//Now exchanging value of
//pivot and P-index
t=a[end];
a[end]=a[P_index];
a[P_index]=t;
//at last returning the pivot value index
return P_index;
}
void Quicksort(int *a,int start,int end)
{
if(start<end)
{
int P_index=partition(a,start,end);
Quicksort(a,start,P_index-1);
Quicksort(a,P_index+1,end);
}
}
int main()
{
int n;
cout<<"Enter number of elements: ";
cin>>n;
int a[n];
cout<<"Enter the array elements:\n";
for(int i=0;i<n;i++)
{
cin>>a[i];
}
Quicksort(a,0,n-1);
cout<<"After Quick Sort the array is:\n";
for(int i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
return 0;
}