#include<iostream>
#include<algorithm>
#include<ctime>
#include<cstdlib>
using namespace std;
const int MAXN=100005;
int a[MAXN],n;
void sort(int l,int r){
if(l>=r)return;
int i=l,j=r,t=a[rand()%(r-l+1)+l];
while(i<=j){
while(a[i]<t)i++;
while(a[j]>t)j--;
if(i<=j){
swap(a[i],a[j]);
i++;
j--;
}
}
sort(l,j);
sort(i,r);
}
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
srand(int(time(0)));
sort(1,n);
for(int i=1;i<n;i++)cout<<a[i]<<" ";
cout<<a[n]<<" ";
return 0;
}
标签:sort,排序,return,int,--,while,include,快速 From: https://www.cnblogs.com/yiheng0913/p/16744610.html