#include<iostream>
using namespace std;
void QSort(int a[],int l,int r);
int main()
{
int m;
cin>>m;
int *a = new int[m];
for(int i =0; i<m; i++)
cin>>a[i];
QSort(a,0,m-1);
for(int i =0; i<m; i++)
cout<<a[i]<<" ";
cout<<endl;
}
void QSort(int a[],int l,int r)
{
if(l > r)
return;
int i = l, j =r;
int temp = a[l];
while(i < j)
{
while(a[j] >= temp && i < j)j--;
a[i] = a[j];
while(a[i] <= temp && i < j)i++;
a[j] = a[i];
}
a[i] = temp;
QSort(a,l,i-1);
QSort(a,i+1,r);
}
快排
最新推荐文章于 2020-05-15 16:36:15 发布