算法Random quicksort(S)
输入 :无序数组S
输出 :有序数组S
1:   QuickSort(A, p, r)
2:      If p<r   then
3:         q = Rand_Partition(A, p, r)
4:         QuickSort(A, p, q-1)
5:         QuickSort(A, q+1, r)
6:   Rand_Partition(A, p, r)
7:      i=Random(p, r)
8:      swap(A[r], A[i])
9:      x=A[r]
10:    i=p-1
11:    for j=p to r-1
12:       If   A[j]<=x   then
13:          i=i+1, swap(A[i], A[j])
14:    swap(A[i+1], A[r])
15:    return i+1

void swap_int(int *a, int *b) {
	if (*a != *b) {
		int temp;
		temp = *a;
		*a = *b;
		*b = temp;
	}	
}

int rand_partition(int *A, int p, int r) {
	srand((unsigned)time(0));
	int i = my_generate_node(p, r+1);
	swap_int(&A[r], &A[i]);
	int x = A[r];
	i = p - 1;
	for (int j = p; j < r; j++) {
		if (A[j] <= x) {
			i++;
			swap_int(&A[i], &A[j]);
		}
	}
	swap_int(&A[i + 1], &A[r]);
	return i + 1;		
}

算法Trple sort(S)
输入 :无序数组S
输出 :有序数组S
1:  设p为S的最小下标，r为S的最大下标
2:   从[p, r]中随机选一个元素作为划分标准v
3:   If 当前i指向的元素==v   then   i←i+1
4:   If 当前i指向的元素<v   then   swap(S[lt+1], S[i]), lt←lt+1, i←i+1
5:   If 当前i指向的元素>v   then   swap(S[gt-1], S[i]), gt←gt-1, i←i+1
6:   If   gt==i   then swap(S[lt], S[p]), lt←lt-1
7:   不断递归，重复第1-6步