Python学习--快排

def partition(arr, low, high):
	# 移动值设置
	i = low - 1
	# 参考值设置
	pivot = arr[high]
	for j in range(low, high):
	# 这里的判断比基准值小就交换i和j
		if arr[j] <= pivot:
			i = i + 1
			arr[i], arr[j] = arr[j], arr[i]
	# 最后还有基准值没有判断，i + 1对应的值一定比基准值大
	arr[i + 1], arr[high] = arr[high], arr[i + 1]
	# i + 1左边最大，一定比右边最小要小
	return i + 1


def quick_sort(arr, low, high):
	if low < high:
		pi = partition(arr, low, high)

		quick_sort(arr, 0, pi - 1)
		quick_sort(arr, pi + 1, high)

arr = [1, 5, 3, 9, 7, 10, 20, 11]
quick_sort(arr, 0, len(arr) - 1)
for x in range(len(arr)):
	print('%d' % arr[x])