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
73
74
75
76
77
78
79
80
81
82
83
|
#include <vector>
#include <iostream>
#include <cstdlib>
//#include <gtest/gtest.h>
using std::vector;
using std::swap;
int partition2(vector<int> &a, int l, int r) {
int x = a[l];
int j = l;
for (int i = l + 1; i <= r; i++) {
if (a[i] <= x) {
j++;
swap(a[i], a[j]);
}
}
swap(a[l], a[j]);
return j;
}
vector<int> partition3(vector<int> &a, int l, int r) {
int x = a[l];
int j = l;
int dupCount = 0;
int biggerNumCount = 0;
for (int i = l + 1; i <= r; i++) {
if (a[i] < x) {
int t = a[i];
a[j] = t;
t = a[i - biggerNumCount];
a[i] = t;
a[i - biggerNumCount] = x;
j++;
continue;
}
if (a[i] == x) {
int t = a[j + dupCount + 1];
a[i] = t;
a[j + dupCount + 1] = x;
dupCount++;
continue;
}
biggerNumCount++;
}
vector<int> m = { j, j + dupCount };
return m;
}
void randomized_quick_sort(vector<int> &a, int l, int r) {
if (l >= r) {
return;
}
int k = l + rand() % (r - l + 1);
swap(a[l], a[k]);
// int m = partition2(a, l, r);
vector<int> m = partition3(a, l, r);
randomized_quick_sort(a, l, m[0] - 1);
randomized_quick_sort(a, m[1] + 1, r);
}
//TEST(ImprovedQuickSort, test1) {
// vector<int> a = { 2, 3, 9, 2, 2 };
// vector<int> result = { 2, 2, 2, 3, 9 };
// randomized_quick_sort(a, 0, a.size() - 1);
// ASSERT_EQ(result, a);
//}
int main() {
int n;
std::cin >> n;
vector<int> a(n);
for (size_t i = 0; i < a.size(); ++i) {
std::cin >> a[i];
}
randomized_quick_sort(a, 0, a.size() - 1);
for (size_t i = 0; i < a.size(); ++i) {
std::cout << a[i] << ' ';
}
}
|
