快速排序-C++
作者:
cmz
,
2022-10-22 17:27:47
,
所有人可见
,
阅读 214
#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int n;
vector<int> a;
void quick_sort(int l, int r)
{
if (l >= r) return ;
int i = l - 1, j = r + 1, 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(l, j);
quick_sort(j+1, r);
}
int main()
{
cin >> n;
for (int i = 0; i < n ;i ++)
{
int t;
cin >> t;
a.push_back(t);
}
quick_sort(0, n - 1);
for (int i = 0; i < n ;i ++) cout << a[i] << " ";
return 0;
}