快速排序的python实现

talk is cheap,show me the code!

def quick(arr):
    if len(arr)<2:
        return arr
    else:
        p=arr[0]
        left=[i for i in arr[1:] if i<=p]
        right=[i for i in arr[1:] if i>p]
        return quick(left)+[p]+quick(right)  #递归对左边和右边排序

arr=[int(i) for i in input().split()]
print(quick(arr))

自从有了python，一切变得好简单。。。