数据结构算法--7 桶排序

def buckt_sort(li,n=10,max_num=1000):   # n为桶的个数
    buckets=[[] for _ in range(n)]       # 创建桶
    for val in li:
        i=min(val // (max_num//n),n-1)   # max_num//n为每个桶内的容量,i表示val放到几号桶
        buckets[i].append(val)    # 加入到i号桶
        # 保持桶内的顺序
        for j in range(len(buckets[i])-1,0,-1):  # 步数为-1,反向冒泡排序
            if buckets[i][j]<buckets[i][j-1]:
                buckets[i][j],buckets[i][j-1]=buckets[i][j-1],buckets[i][j]
            else:
                break
    sotr_list = []
    for buc in buckets:  # buc为一个列表(每个桶),一维
        sotr_list.extend(buc)
    return sotr_list

# 测试
import random
li=[random.randint(0,1000) for i in range(1000)]
li=buckt_sort(li)
print(li)