#include<iostream>
using namespace std;
const int N = 1e6+10;
int q[N];
int n;
void quick_sort(int q[] , int l , int r)
{
if(l>=r) return ;
int x = q[(l+r)/2];
int i = l-1;
int j = r+1;
while(i<j)
{
do i++;
while(x>q[i]);
do j--;
while(x<q[j]);
if(i<j)
{
int t = q[i];
q[i] = q[j];
q[j] =t;
}
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);
}
int main()
{
cin>>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;
}
快速排序.
于 2023-04-23 14:46:10 首次发布