快速排序

// 快速排序
void QuickSort(int *pArr, int nLeft, int nRight)
{
    int i = nLeft;
    int j = nRight;
    int nCankao = pArr[i];

    if (nLeft > nRight)
    {
        return;
    }
    while (i != j)
    {
        for (; pArr[j] >= nCankao && i < j; j --)
        {
        }
        for (; pArr[i] <= nCankao && i < j; i ++)
        {
        }
        int nTemp = pArr[j];
        pArr[j] = pArr[i];
        pArr[i] = nTemp;
        
    }
    pArr[nLeft] = pArr[i];
    pArr[i] = nCankao;

    QuickSort(pArr, nLeft, i - 1);
    QuickSort(pArr, i + 1, nRight);
}