代码

#include <algorithm>

void sort(unsigned *a, int n) {
	if (n <= 1) return;
  	const int pivot = a[rand() % n];
	int i = 0, j = 0, k = n;
	while (i < k) {
		if (a[i] < pivot)
			std::swap(a[i++], a[j++]);
    	else if (pivot < a[i])
			std::swap(a[i], a[--k]);
		else
			i++;
	}
	sort(a, j);
	sort(a + k, n - k);
}

评测结果