快速排序Python
从《代码图解中所学》,做个记录。
def quicksort(array):
if(len(array))<2:
return array
else:
pivot = array[0] # 基准值
less = [i for i in array[1:] if i<= pivot] # 找到所有小于基准值元素
greater = [i for i in array[1:] if i>pivot] # 找到所有大于基准值元素
return quicksort(less) + [pivot] + quicksort(greater)
if __name__ =="__main__":
a = [1,4,23,4,8,9,2,13,11,25,27,21]
result = quicksort(a)
print("result: ", result)