快速排序

void Quick_Sort(int arry[], int low, int high)
{
    int i, j,pivot;
    if(low < high)
    {
        pivot = arry[low];
        i = low;
        j = high;

        while(i < j)
        {
            while(i < j && arry[j] >= pivot)
            {
                j--;
            }
            if(i < j)
            {
                arry[i++] = arry[j];
            }
            while(i < j && arry[i] <= pivot)
            {
                i++;
            }
            if(i < j)
            {
                arry[j--] = arry[i];
            }

            arry[i] = pivot;

            Quick_Sort(arry,low,i-1);
            Quick_Sort(arry,i+1,high);
        }
    }
}
void main()
{
    int i;
    int   array[9] = {54,38,96,23,15,72,60,45,83};

    for(i = 0; i < 9; i++)
    {
        printf("%d ",array[i]);
    }
    printf("/n");
    Quick_Sort(array,0,8);
    for(i = 0; i < 9; i++)
    {
        printf("%d ",array[i]);
    }
   
    getch();
}