- 首先将元素分在不同的桶中,在对每一个1桶中的元素排序
def bucket_sort(li, n=10, max_num=100):
buckets = [[]for _ in range(n+1)] # 11个桶
for val in li:
i = val // (max_num // n) # i表示val放到几号桶里
buckets[i].append(val) # 把val加到对应的桶里面
# 桶内排序
for j in range(len(buckets[i])-1, 0, -1):
if buckets[i][j] < buckets[i][j-1]:
a = buckets[i][j]
buckets[i][j]=buckets[i][j-1]
buckets[i][j-1]=a
else:
break
sorted_li = []
for buc in buckets:
sorted_li.extend(buc) # 把一个列表加到后面
return sorted_li
import random
li = [random.randint(0,100) for i in range(50)]
print(li)
li = bucket_sort(li)
print(li)