快速排序算法

int Partition(int * a, int low, int high)
{
    int pivotkey=a[low];
    int t=a[low];
    while(low<high)
    {
        while(low<high && a[high]>=pivotkey)--high;
        a[low]=a[high];
        while(low<high && a[low]<=pivotkey)++low;
        a[high]=a[low];
    }
    a[low]=t;
    return low;
}
void QuickSort(int * a,int low,int high)
{
    int pivotloc;
    if(low<high)
    {
        pivotloc=Partition(a,low,high);
        QuickSort(a,low,pivotloc-1);
        QuickSort(a,pivotloc+1,high);    
    }
}