def quicksort(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 quicksort(less) + [pivot] + quicksort(greater) arr = [9,8,4,5,32,64,2,1,0,10,19,27] print(quicksort(arr))
参考自:《改善Python程序的91个建议.pdf》