排序之三----快速排序

int partation(int a[],int p, int r){int q = p+1;int tmp = a[p];int t=0;for(int i=q;i<r+1;i++){if(a[i]<tmp){t=a[q];a[q++]=a[i];a[i]=t;}}t =a[p];a[p]=a[q-1];a[q-1]=t;return q-1;}void quickSort(int a[],int p,int r){if(p < r){int q = partation(a,p,r);quickSort(a,p,q-1);quickSort(a,q+1,r);}}