快速排序

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[10001];void quick(int l, int r){if(l>=r) return;int key=a[l];int ll=l;int rr=r;while(ll<rr){while(ll<rr&&a[rr]>=key)rr--;a[ll]=a[rr];while(ll<rr&&a[ll]<=key)ll++;a[rr]=a[ll];}a[ll]=key;quick(l,rr-1);quick(rr+1,r);}int main(){int i,j,k,m,n,l;while(~scanf("%d",&n)){for(i=0;i<n;i++){scanf("%d",&a[i]);}quick(0,n-1);for(i=0;i<n;i++){printf("%d ",a[i]);}}return 0;}