面试高频题

1.通过Python递归实现快排：

def quick_sort(array):
    if len(array)<2:
        return array
    else:
        pivot=array[0]
        less=[x for x in array[1:] if x<=pivot]
        more=[x for x in array[1:] if x> pivot]
        return quick_sort(less)+[pivot]+quick_sort(more)

# test
a=[9,4,8,6,1,2,3,7]
print(quick_sort(a))