-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathquicksort.cpp
72 lines (70 loc) · 1.25 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
63
64
65
66
67
68
69
70
71
72
#include <iostream>
using namespace std;
void swapp(int &a, int &b)
{
int temp;
temp = a;
a = b;
b = temp;
}
int partition(int arr[], int s, int e)
{
int count = 0;
for (int a = s+1 ; a <= e; a++)
{
if (arr[a] <= arr[s])
{
count++;
}
}
swapp(arr[s], arr[s+count]);
int i, j;
i = s;
j = e;
while (i < count && j > count)
{
if(arr[i] <= arr[s+count] || arr[j] > arr[s +count])
{
if (arr[i] <= arr[s+ count])
{
i++;
}
if (arr[j] > arr[s + count])
{
j--;
}
}
else
{
swapp(arr[i++], arr[j--]);
}
}
return s+count;
}
void quicksort(int arr[], int s, int e)
{
if (s >= e)
{
return;
}
int c;
c = partition(arr, s, e);
quicksort(arr, s, c - 1);
quicksort(arr, c + 1, e);
}
int main()
{
int arr[5];
cout<<"enter elementd"<<endl;
for (int i = 0; i < 5; i++)
{
cin >> arr[i];
}
quicksort(arr, 0, 4);
cout<<"sorted"<<endl;
for (int i = 0; i < 5; i++)
{
cout << arr[i]<<" ";
}
return 0;
}