21 快速排序
把递归思想用到排序中
大纲
快速排序算法
def quick_sort_list(x):
if len(x)<2:
return x
else:
mid = x[0]
less = [value for value in x[1:] if value <= mid]
greater = [value for value in x[1:] if value > mid]
output = quick_sort_list(less)+[mid]+quick_sort_list(greater)
return output
quick_sort_list([14,6,7,4,9,30])[4, 6, 7, 9, 14, 30]找到高频词
Last updated