快排的随机化算法

int randQuickSort(int *x, int p, int q){
if(p < q){
int rand_n = rand()%(q-p+1);    //随机化选择交换pivot的位置
int temp = x[rand_n+p];
x[rand_n+p] = x[p];
x[p] = temp;

int r = part(x, p, q);
quickSort(x, p, r-1);
quickSort(x, r+1, q);
}
return 0;
}