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
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int maxn = 2e5 + 10;
int a[maxn];
int n;
void quickSort(int left, int right)
{
if (left >= right)
return;
int temp = a[left];
int i = left;
int j = right;
while (i < j)
{
while (a[j] >= temp && i < j)
{
j--;
}
swap(a[i], a[j]);
while (a[i] <= temp && i < j)
{
i++;
}
swap(a[i], a[j]);
}
for (int i = 1; i <= n; ++i)
{
cout << a[i] << " ";
}
cout << "\n";
quickSort(left, i - 1);
quickSort(i + 1, right);
return;
}
void solve()
{
cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
if(n==1)
return;
quickSort(1, n);
cout << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--)
solve();
return 0;
}
|