桶排序

 

 

 

#桶排序

L=[2,6,3,1,3,4,6,2,2,8,5]
tong=(max(L)-min(L)+1)*['']
for i in L:
    if not tong[i+min(L)-2]:tong[i+min(L)-2]=[i]
    #希望去重把下面这句注释
    else:tong[i+min(L)-2].append(i)
[[print(i,end='-->') for i in l] for l in filter(lambda x:x,tong)]