python实现bucket排序算法实例分析

本文实例讲述了python实现bucket排序算法。分享给大家供大家参考。具体实现方法如下：

    def bucketSort(a, n, buckets, m):
      for j in range(m):
        buckets[j] = 0
      for i in range(n):
        buckets[a[i]] += 1
      i = 0
      for j in range(m):
        for k in range(buckets[j]):
          a[i] = j
          i += 1

希望本文所述对大家的Python程序设计有所帮助。