def sort_1(li):
if len(li) == 0 :
return []
tmp = li[0]
left = [i for i in li[1:] if i <= tmp]
right = [j for j in li[1:] if j > tmp]
left = sort_1(left)
right = sort_1(right)
return left + [tmp] + right
快排(python实现)def sort_1(li): if len(li) == 0 : return [] tmp = li[0] left = [i for i in li[1:] if i <= tmp] right = [j for j in li[1:] if j > tmp] left = sort_1(left) right = sort_1(right) return left + [tmp] + rig