def quickSort(lst):
if len(lst) <= 1:
return lst
smaller = [x for x in lst[1:] if x < lst[0]]
larger = [x for x in lst[1:] if x >= lst[0]]
return quickSort(smaller) + [lst[0]] + quickSort(larger)
# Main Function
if __name__ == '__main__':
lst = [2, 4, 5, 1]
print(quickSort(lst))
Python快速排序quickSort()
最新推荐文章于 2021-04-02 12:17:43 发布