python实现计数排序与桶排序实例代码

def count_sort(s):  """计数排序"""  # 找到最大最小值  min_num = min(s)  max_num = max(s)  # 计数列表  count_list = [0]*(max_num-min_num+1)  # 计数  for i in s:    count_list[i-min_num] += 1  s.clear()  # 填回  for ind,i in enumerate(count_list):    while i != 0:      s.append(ind+min_num)      i -= 1if __name__ == '__main__':  a = [3,6,8,4,2,6,7,3]  count_sort(a)  print(a)

def bucket_sort(s):  """桶排序"""  min_num = min(s)  max_num = max(s)  # 桶的大小  bucket_range = (max_num-min_num) / len(s)  # 桶数组  count_list = [ [] for i in range(len(s) + 1)]  # 向桶数组填数  for i in s:    count_list[int((i-min_num)//bucket_range)].append(i)  s.clear()  # 回填，这里桶内部排序直接调用了sorted  for i in count_list:    for j in sorted(i):      s.append(j)if __name__ == '__main__':  a = [3.2,6,8,4,2,6,7,3]  bucket_sort(a)   print(a) # [2, 3, 3.2, 4, 6, 6, 7, 8]