快排

/*By Yuan2014.6.20At NWPU.XF*/#include#includeusing namespace std;void Qsort(int a[],int n,int l,int h){int t,i,j; if(l<h){i=l,j=h+1; while(1){ while(i+1<n&&a[++i]-1&&a[--j]>a[l]); if(i>=j) break; t=a[i];a[i]=a[j];a[j]=t;} t=a[l];a[l]=a[j];a[j]=t; Qsort(a,n,l,j-1); Qsort(a,n,j+1,h);}}int main(){ int a[10000]; int n; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); Qsort(a,n,0,n-1); for(int j=0;j<n;j++) cout<<a[j]<<endl; //cout<<endl; return 0;}