简单桶排序算法-python实现

 #-*- coding: UTF-8 -*-
 import numpy as np

 def BucketSort(a, n):
     barrel = np.zeros((1, n), dtype = 'int32')
     for i in xrange(0,a.size):
         barrel[0][a[i]] += 1
     k = 0
     for i in xrange(0,n):
         if barrel[0][i] != 0:
             for j in xrange(0,barrel[0][i]):
                 a[k] = i
                 k += 1

 if __name__ == '__main__':
     a = np.random.randint(0, 100, size = 10)
     print "Before sorting..."
     print "---------------------------------------------------------------"
     print a
     print "---------------------------------------------------------------"
     BucketSort(a, 100)
     print "After sorting..."
     print "---------------------------------------------------------------"
     print a
     print "---------------------------------------------------------------"