用python实现“桶排序”

from quick_sort import quick_sort    #从快排引入快排包

def bucket_sort(alist, bucketsize):
    minValue = alist[0]
    maxValue = alist[1]
    
    for i in alist:
        if i < minValue:
            minValue = i
        elif i > maxValue:
            maxValue = i
    #桶数量
    bucketcount = (maxValue - minValue +1) // bucketsize
    #对应的桶
    bucket_lists = list([] for _ in range(bucketcount))
    
    #把数据放入相应的桶
    for i in alist:
        bucket_index = (i - minValue) // bucketsize
        bucket_lists[bucket_index].append(i)
     
    
    #桶内快排
    for j in bucket_lists:
        quick_sort(j, 0, len(j)-1)     #这里采用的是快排，需要引入快排的包，因为篇幅原因，这里不放快排的代码
    
    #合并数据
    result = []
    for j in bucket_lists:
        if len(j) != 0:
            result.extend(j)
    return result