-
Notifications
You must be signed in to change notification settings - Fork 3
/
qksort.cpp
64 lines (58 loc) · 1.11 KB
/
qksort.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
#include <iostream>
using namespace std;
void swap(int * a, int * b)
{
int temp = *a;
*a = *b;
*b = temp;
}
int partition(int number[], int start, int end)
{
if(start == end)
{
return start;
}
int pivotIndex = start + (end - start) / 2;
int pivot = number[pivotIndex];
int oldEnd = end;
swap(&number[pivotIndex], &number[end]);
while(start <= end)
{
if(start <= end && number[start] < pivot)
{
start++;
}
while(start <= end && pivot <= number[end])
{
end--;
}
if(start < end)
{
swap(&number[start], &number[end]);
}
}
swap(&number[start], &number[oldEnd]);
return start;
}
void qksort(int number[], int start, int end)
{
int index = partition(number, start, end);
if(index > start)
{
qksort(number, start, index - 1);
}
if(index < end)
{
qksort(number, index + 1, end);
}
return;
}
int main(void)
{
int array[10] = {1,8, 5, 3, 8,2,7,4,6, 10};
qksort(array, 0, 9);
for(int i = 0; i < 10; i++)
{
cout << array[i] << " ";
}
}