def quick_sort(list_to_sort):
if len(list_to_sort) <= 1:
return list_to_sort
else:
return quick_sort([s for s in list_to_sort[1:] if s <= list_to_sort[0] ] )+ [list_to_sort[0]] + quick_sort([x for x in list_to_sort[1:] if x >list_to_sort[0] ])
s = quick_sort([1,4,2,0])
print(s)
快排Python实现
猜你喜欢
转载自blog.csdn.net/listep/article/details/79760745
今日推荐
周排行