bucket_sort.py

def bucket_sort(vector: list, bin_count: int):
    bins = [[] for _ in range(bin_count)] # create a list of empty lists to the bin_count

    # define the maximum, minimum and range of values within the data being sorted
    M, m = max(vector), min(vector)

    r = M - m

    # group the items into bins
    for item in vector:
        bin_ = int(
            round(
                ((item - m) / r) * (bin_count - 1)
            )
        )

        bins[bin_].append(item)

    out_list = []
    # sort each bin inplace individually, then concatenate them
    for b in bins:
        b.sort()
        out_list.extend(b)

    return out_list