【算法导论】c++实现的随机化的快速排序

随机化的快速排序：

#include <iostream>
#include <set>
#include <string>
void swap(int * a,int * b);
int partition(int * array_list,int left,int right);
void Print();
int random_partition(int * array_list,int left,int right);
void random_quick_sort(int * array_list,int left,int right);
const int size = 100;
//int array_list [] ={2,8,7,1,3,5,6,4};
int * array_list;
int main()
{
	//const int size = 10;
	array_list = new int [sizeof(int)*size];
	srand(0);
	for(int i=0;i<size;i++)
	{/*随即的填充数组元素*/
		int ran_num=rand()% size;
		array_list[i] = ran_num;
	}
	random_quick_sort(array_list,0,size - 1);
	Print();
	return 0;
}

void random_quick_sort(int * array_list,int left,int right)
{
	if(left >= right)
	{
		return ;
	}
	int index = random_partition(array_list,left,right);
	random_quick_sort(array_list,left,index - 1);
	random_quick_sort(array_list,index + 1,right);
}
/*随机化的快速排序