快速排序

代码：

int qqsort(int shu[],int left,int right){    int i=left,j=right,middle,key;    middle=shu[(left+right)/2];    do    {        while(i<right&&shu[i]<middle)i++;        while(j>left&&shu[j]>middle)j--;        if(i<=j){key=shu[i];shu[i]=shu[j];shu[j]=key;i++;j--;}    }while(i<=j);    if(left<j)qqsort(shu,left,j);    if(i<right)qqsort(shu,i,right);    return 0;}

链接：http://baike.baidu.com/view/19016.htm?fromId=115472