def quick_sort(lst): if len(lst) < 2: return lst pivot = lst[0] left = [i for i in lst[1:] if i <= pivot] right = [i for i in lst[1:] if i > pivot] return quick_sort(left) + [pivot] + quick_sort(right) # 测试 nums = [5, 4, 6, 2, 1, 3] print(quick_sort(nums))