AcWing 785. 快速排序
原题链接
简单
作者:
Vy_1z
,
2024-03-11 12:02:20
,
所有人可见
,
阅读 11
#include <iostream>
using namespace std;
const int N = 1000010;
int q[N];
void quick_sort(int q[], int l, int r)
{
if (l >= r) return;
int i = l, j = r, x = q[(l + r )/2];
while (i < j)
{
while (q[i] < x)i ++ ;
while (q[j] > x) j --;
if (i <= j)
{
swap(q[i], q[j]);
i++;
j--;
}
}
quick_sort(q, l, j);
quick_sort(q, i, r);
}
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i ++ ) scanf("%d", &q[i]);
quick_sort(q, 0, n - 1);
for (int i = 0; i < n; i ++ ) printf("%d ", q[i]);
return 0;
}