27 lines
660 B
C++
27 lines
660 B
C++
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
const int INF = 0x3f3f3f3f;
|
|
typedef long long LL;
|
|
const int N = 1e5 + 10;
|
|
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, x = q[(l + r) >> 1];
|
|
while (i < j) {
|
|
do i++;
|
|
while (q[i] < x);
|
|
do j--;
|
|
while (q[i] > x);
|
|
if (i < j) swap(q[i], q[j]);
|
|
}
|
|
quick_sort(q, l, j), quick_sort(q, j + 1, r);
|
|
}
|
|
int main() {
|
|
scanf("%d", &n);
|
|
for (int i = 1; i <= n; i++) scanf("%d", &q[i]);
|
|
quick_sort(q, 1, n);
|
|
for (int i = 1; i <= n; i++) printf("%d ", q[i]);
|
|
return 0;
|
|
} |