def quick_sort(arr): if len(arr) <= 1: return arr else: # 选取基准值pivot pivot = arr[0] # 将小于基准值的数放在左侧，大于基准值的数放在右侧 left = [i for i in arr[1:] if i <= pivot] right = [i for i in arr[1:] if i > pivot] # 递归排序左侧和右侧 return quick_sort(left) + [pivot] + quick_sort(right)

测试

arr = [3, 7, 1, 6, 8, 2, 5, 4] print(quick_sort(arr)) # [1, 2, 3, 4, 5, 6, 7, 8]