AcWing 785. 快速排序
原题链接
简单
作者:
LingYunX
,
2021-02-08 22:18:40
,
所有人可见
,
阅读 292
//每日一遍快排乐无边
#include <iostream>
using namespace std;
const int N = 100010;
int n;
int a[N];
void quick_sort(int a[], int l, int r){
if (l >= r) return ;
int i = l - 1, j = r + 1;
int x = a[l + r >> 1];
while (i < j){
do{
i ++;
}while (a[i] < x);
do{
j --;
}while (a[j] > x);
if (i < j) swap(a[i], a[j]);
}
quick_sort(a, l, j);
quick_sort(a, j + 1, r);
}
int main(){
scanf("%d", &n);
for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
quick_sort(a, 0, n - 1);
for (int i = 0; i < n; i ++) printf("%d ", a[i]);
return 0;
}