快排算法（Python实现）

快速排序算法的简要Python实现：

def quick_sort(array):
	less = []
	greater = []
	if len(array) <= 1:
		return array
	pivot = array.pop()
	for x in array:
		if x <= pivot: less.append(x)
		else: greater.append(x)
	return quick_sort(less) + [pivot] + quick_sort(greater)

array = [9,10,8,15,6,7,1]
print(quick_sort(array))