快速排序代码

快速排序代码：

//快速排序
void QuickSort(ElemType A[],int low,int high){
    if(low<high){
        int pivotpos=Partition(A,low,high)
        QuickSort(A,low,pivotpos-1);
        QuickSort(A,pivotpos+1,high);
    }
}
int Partition(ElemType A[],int low,int high){
    ElemType pivot=A[low];
    while(low<high){
        while(low<high&&A[high]>A[pivot]){
            high--;
        }
        A[low]=A[high];
        while(low<high&&A[low]<A[pivot]){
            low++;
        }
        A[high]=A[low];
    }
    A[low]=pivot;
    return low;
}