快速排序C++实现

C++实现代码

bool QuickSort(int* array,int len,int left,int right)
{
	if(!array){return false;}
	if(len<=0 || left<0 || right<0){return false;}
	if(left>right || left>len || right>len){return false;}
	int base = array[left];
	int ldx=left,rdx=right;
	int chg = 0;
	while(ldx<rdx)
	{
		while(array[rdx]>=base && ldx<rdx)
			--rdx;
		while(array[ldx]<=base && ldx<rdx)
			++ldx;
		if(ldx<rdx)
		{
			chg = array[ldx];
			array[ldx] = array[rdx]；
			array[rdx] = chg;
		}
	}
	// 当ldx==rdx时,交换array[ldx]和base的值;
	array[left] = array[ldx];
	array[ldx] = base;
	// 递归左右子数组;
	QuickSort(array,len,left,ldx-1);
	QuickSort(array,len,rdx+1,right);
	return true;
}