快速排序

int quickSort(int left, int right, int arr[])
{
	if(left >= right)
		return 0;
	int i = left, j = right, base = 0;
	base = arr[left];
	while(i < j)
	{
	//必须先从右往左再从左往右
		while(arr[j] >= base && i < j)
			j--;
		while(arr[i] <= base && i < j)
			i++;

		if(i < j)
		{
			int temp = arr[i];
			arr[i] = arr[j];
			arr[j] = temp;
		}
	}
	arr[left] = arr[i];
	arr[i] = base;
	quickSort(left, i - 1, arr);
	quickSort(i+1, right, arr);
}

图解快速排序