快排随机使用一个元素作为基准

#include <iostream>
using namespace std;
const int N = 1e6 + 10;  

int n;
int q[N];

void quick_sort(int q[], int l, int r)
{
	if (l >= r) return;
	int x = q[rand()% (r-l+1)+l];
	int i = l - 1, j = r + 1; 
	while (i < j) {
		do i++; while (q[i] < x);
		do j--; while (q[j] > x);
		if (i < j) swap(q[i], q[j]);	//如果i与j没有相遇，就交换一下
	}

	quick_sort(q, l, j);	//递归处理左右两边
	quick_sort(q, j + 1, r);
}

int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%d", &q[i]);
	quick_sort(q,0,n-1);
	for (int i = 0; i < n; i++) printf("%d ", q[i]);
	return 0;
}