AcWing 785. 快速排序
原题链接
简单
作者:
wzc1998
,
2021-01-13 20:20:48
,
所有人可见
,
阅读 579
#include <iostream>
using namespace std;
int n;
const int maxn = 100010;
int q[maxn];
void quick_sort(int q[], int l, int r){
if(l >= r) return;
int x = q[l + r >> 1], i = l - 1, j = r + 1;
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(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> q[i];
}
quick_sort(q, 0, n - 1);
for(int i = 0; i < n; i++){
cout << q[i] << " ";
}
return 0;
}