原题链接:
题解:
套板子即可
代码:
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
void quick_sort(int q[], int l, int r) {
if (l >= r) return;
int i = l - 1, j = r + 1, x = q[(l + r) / 2];
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, j), quick_sort(q, j + 1, r);
}
int main() {
int a[N];
int n;cin >> n;
for (int i = 0;i < n;i++) cin >> a[i];
quick_sort(a, 0, n - 1);
for (int i = 0;i < n;i++) cout << a[i] << " ";
}