快排

def quicksort(arr):
    if len(arr)<2:
        return arr
    else:
        pri=arr[0]
        less=[i for i in arr[1:] if i<pri]
        greater=[i for i in arr[1:] if i>pri ]
        return quicksort(less)+[pri]+quicksort(greater)

快排了解一下