python快速排序

def quicksort(arr):
    if len(arr) < 2:
        return arr
    else:
        pivot = arr[0]
        left = [x for x in arr[1:] if x < pivot]
        rigtt = [x for x in arr[1:] if x > pivot]
        return quicksort(left) + [pivot] + quicksort(rigtt)
print(quicksort([2, 5, 4, 8, 9, 16, 14]))