-
Notifications
You must be signed in to change notification settings - Fork 1
/
quick_sort.cpp
55 lines (43 loc) · 1.05 KB
/
quick_sort.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
#include <iostream>
#include <conio.h>
using namespace std;
void swap(int& a, int& b) {
int temp = a;
a = b;
b = temp;
}
void quick_sort(int arr[], int low, int high) {
if (low < high) {
int pivot = arr[low]; // Choose the first element as pivot
int i = low - 1;
int j = high + 1;
while (true) {
do {
i++;
} while (arr[i] < pivot);
do {
j--;
} while (arr[j] > pivot);
if (i >= j)
break;
swap(arr[i], arr[j]);
}
quick_sort(arr, low, j);
quick_sort(arr, j + 1, high);
}
}
void display_arr(int arr[], int size) {
cout << "[ ";
for (int i = 0; i < size; i++) {
cout << arr[i] << ", ";
}
cout << "]" << endl;
}
int main() {
int arr[] = {10, 24, 21, 57, 90};
int size = sizeof(arr) / sizeof(arr[0]);
quick_sort(arr, 0, size - 1);
display_arr(arr, size);
getch();
return 0;
}