c++快速排序

int partition(int arr[],int low,int high);
void quick_Sort(int arr[],int low,int high);
int main()
{
	int len,i;
	int arr[] = {2,5,4,1,8,7,4,5,8,8,7,4,5,4,5,4,5,4,1,6};
	len = sizeof(arr)/sizeof(int);
	quick_Sort(arr,0,len-1);
	for(i=0;i<len;i++)
	{
		printf("%d  ",arr[i]);
	}
}
int partition(int arr[],int low,int high)//一次分割函数 
{
	int key = arr[low];//记录中轴
	while(low<high)
	{
		while(low<high&&arr[high]>=key)
		{
			high--; 
		}
		arr[low] = arr[high];//high位置的元素小于中轴，将high位置的元素放到low位置
		while(low<high&&arr[low]<=key)
		{
			low++;	
		} 
		arr[high] = arr[low];
	}
	arr[low] = key;//将中轴放到最终的位置上(下标)
	return low; 
}
void quick_Sort(int arr[],int low,int high)
{
	int mid;
	if(low<high)
	{
		mid = partition(arr,low,high);//接收返回中轴的位置(下标)
		quick_Sort(arr,low,mid-1);//在左侧继续划分 
		quick_Sort(arr,mid+1,high);//在右侧继续划分 
	}
}