c语言实现快排

void Swap(int* scores, int i, int j)
{
    int temp = scores[i];
    scores[i] = scores[j];
    scores[j] = temp;
}
int pivot(int* scores, int l, int r)
{
    int pivotKey = scores[l];

    while (l < r)
    {
        while (l<r && scores[r]>pivotKey)
        {
            r--;
        }
        Swap(scores, l, r);     //交换完后r处为pivotKey

        while (l < r && scores[l] < pivotKey)
        {
            l++;                //交换完后l处为pivotKey
        }
        Swap(scores, l, r);
    }

    return l;
}

void Sort(int* scores, int l, int r)
{
    if (l < r)
    {
        int p = pivot(scores, l, r);

        Sort(scores, l, p - 1);
        Sort(scores, p + 1, r);
    }
}

int* fastSort(int* scores, int scoreLen)
{
    Sort(scores, 0, scoreLen - 1);
}

int main(int argc, char** argv)
{
    int a[6] = { 1,34,4,5,35,24 };

    fastSort(a, 6);
    for (int i = 0; i < 6; i++)
    {
        printf("%d ", a[i]);
    }
    printf("\n");

    return 0;
}