快速排序

void quicksort(int arry[],int left,int right)
{
    int i=left,j=right,key=arry[left];
    while(i<j)
    {
        while(i<j&&arry[j]>=key) j--;
        arry[i]=arry[j];
        while(i<j&&arry[i]<=key) i++;
        arry[j]=arry[i];
    }
    arry[i]=key;
    if(i-left) quicksort(arry,left,i-1);
    if(right-i) quicksort(arry,i+1,right);
}