桶排序算法

def bucket_sort(elements, num):
    n = int(len(elements) / num) + 1
    buckets = [[] for i in range(n)]
    ma = max(elements)
    mi = min(elements)
    gap = int((ma - mi) / n) + 1
    for e in elements:
        d = int(((e - mi) / gap))

        bucket_size = len(buckets[d])
        for b in range(bucket_size):
            if e < buckets[d][b]:
                buckets[d].insert(b, e)

        if bucket_size == len(buckets[d]):
            buckets[d].append(e)
    
    del elements[:]
    for bucket in buckets:
        for b in bucket:
            elements.append(b)

if __name__ == '__main__':
    arr = [61, 71, 14, 30, 18]
    bucket_sort(arr, 2)
    print(arr)