Algorithm: Bucket sequencing

Pass sorting is a waste of space, such as the range that needs to be sorted 0~2000 between, the number that needs to be sorted is [3,9,4,2000], also need 2001 space

Note: sorting cannot sort decimals

def bucketsort (nums):
    # Select a maximum number
    Max_num = max (nums)
    # Create an element that is all a list of 0, as a bucket
    bucket = [0]* (max_num+1)
    # put all the elements into the bucket, that is, the number of corresponding elements plus one
    For I in Nums:
        Bucket[i] + = 1

    # Store sorted elements
    Sort_nums = []
    # Remove the elements from the bucket
    For j in Range (len):
        If BUCKET[J]! = 0:
            For y in range (Bucket[j]):
                Sort_nums.append (j)

    Return sort_nums

Nums = [5,6,3,1,65,2]
Print (Bucketsort (nums))
X

Algorithm: Bucket sequencing