桶排序与快速排序算法结合-python实现

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

def BucketSort(a, n):
    barrel = {}
    for i in xrange(0,n):
        barrel.setdefault(i, [])
    min = np.min(a)
    max = np.max(a)
    for x in a:
        for i in xrange(0,n-1):
            if x >= min +i* (max - min)/n and x < min +(i +1) * (max - min)/n:
                barrel[i].append(x)
            elif i == n-2 and x >=  min +(i +1) * (max - min)/n:
                barrel[i+1].append(x)
    k = 0
    for i in xrange(0,n):
        if len(barrel[i]) != 0:
            arr = np.array(barrel[i])
            QuickSort(arr, 0, len(barrel[i]) -1)
            for x in arr:
                a[k] = x
                k += 1



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