桶排序

def bucket_sort(arr):
    bucket = [0]*(max(arr)-min(arr)+1)

    for i in range(len(arr)):
        bucket[arr[i]-min(arr)] += 1
    print(bucket)

    res = []
    for i in range(len(bucket)):
        if  bucket[i] != 0:
            res += [i+min(arr)]*bucket[i]


    return res