算法 -快速排序

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

print(quicksort([5,8,2,1,4,2,7]))