-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquick_sort.cpp
More file actions
60 lines (48 loc) · 1.29 KB
/
Copy pathquick_sort.cpp
File metadata and controls
60 lines (48 loc) · 1.29 KB
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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <random>
#define KRED "\x1B[31m"
#define RESET "\x1B[0m"
using namespace std;
void print(int *arr, int sz, int left, int right)
{
int i = 0;
while (i < sz) {
if (i == left || i == right)
printf(KRED "%d" RESET " ", arr[i++]);
else
printf("%d ", arr[i++]);
}
cout << endl;
}
int partition(int* arr, int left, int right)
{
int pivot = left;
int i = left + 1;
int j = right;
while (i < j) {
while (i <= j && arr[i] <= arr[pivot]) i++;
while (i <= j && arr[j] > arr[pivot]) j--;
if (i < j) swap(arr[i], arr[j]);
}
swap(arr[i - 1], arr[pivot]);
return i - 1;
}
void quicksort(int *arr, const int left, const int right, const int sz)
{
if (left >= right) return;
printf("left: %d, right: %d | ", left, right);
print(arr, sz, left, right);
int part = partition(arr, left, right);
quicksort(arr, left, part - 1, sz);
quicksort(arr, part + 1, right, sz);
}
int main()
{
int arr[8] = {110, 5, 10,3 ,22, 100, 1, 23};
int sz = sizeof(arr) / sizeof(arr[0]);
cout << "before: "; print(arr, sz, 0, sz - 1); cout << "\n";
quicksort(arr, 0, sz - 1, sz);
cout << "\nafter : "; print(arr, sz, 0, sz - 1);
}