递归排序

 
 
def sort(data):
    length = len(data) 
  
    if length <= 1:
        return data
    pro = data[int(length/2)]

    middle = [x for x in data if x == pro]
    left = [x for x in data if x < pro]
    right = [x for x in data if x>pro]

    return sort(left) + middle + sort(right)

 

猜你喜欢

转载自blog.csdn.net/qq_27015119/article/details/80751832