代码

#include <bits/stdc++.h>

void Quicksort(unsigned *a, int l, int r)
{
    if (l >= r) { return; }

    int i = l, j = r, t = a[rand() % (r - l  + 1) + l];

    while (i <= j)
    {
        while (a[i] < t) { i++; }
        while (a[j] > t) { j--; }
        if (i <= j)
        {
            std::swap(a[i], a[j]);
            i++, j--;
        }
    }

    Quicksort(a, l, j);
    Quicksort(a, i, r);

    return;
}

void sort(unsigned *a, int n) {
	srand(int(time(0)));
Quicksort(a, 1, n);
}

评测结果