31 lines
685 B
C++
31 lines
685 B
C++
#include <bits/stdc++.h>
|
||
|
||
using namespace std;
|
||
const int N = 100010;
|
||
int q[N];
|
||
int n;
|
||
|
||
void quick_sort(int q[], int l, int r) {
|
||
if (l >= r) return;
|
||
int i = l - 1, j = r + 1;
|
||
int x = q[(l + r + 1) >> 1]; // 非得要用i这里要修改！
|
||
|
||
while (i < j) {
|
||
do i++;
|
||
while (q[i] < x);
|
||
|
||
do j--;
|
||
while (q[j] > x);
|
||
|
||
if (i < j) swap(q[i], q[j]);
|
||
}
|
||
quick_sort(q, l, i - 1), quick_sort(q, i, r); // 非得要用i这里要修改！
|
||
}
|
||
|
||
int main() {
|
||
cin >> n;
|
||
for (int i = 1; i <= n; i++) cin >> q[i];
|
||
quick_sort(q, 1, n);
|
||
for (int i = 1; i <= n; i++) printf("%d ", q[i]);
|
||
return 0;
|
||
} |