快排

#include<cstdio>#include<cstring>const int N=1e5;int a[N];void qsort(int l,int r){if(l>=r) return ;int i=l,j=r,k=a[l];while(i<j){while(i<j&&k<a[j]) j--;if(i<j) { a[i]=a[j];i++;}while(i<j&&k>a[i]) i++;if(i<j) { a[j]=a[i];j--;}}a[i]=k;qsort(l,i-1);qsort(i+1,r);}int main(){int i,n;while(scanf("%d",&n)&&n){for(i=1;i<=n;i++)scanf("%d",&a[i]);qsort(1,n);for(i=1;i<n;i++)printf("%d ",a[i]);printf("%d\n",a[n]);}}