counting-sort.py

# Python implementation for Counting Sort Algorithm

def countingsort(array):
    size = len(array)
    output = [0] * size

    # Initialize the count array
    count = [0] * 10

    # Store the count of each element in the count array
    for i in range(0, size):
        count[array[i]] += 1

    # Store the cummulative count
    for i in range(1, 10):
        count[i] += count[i - 1]

    # Find the index of each element of the original array in count array place the elements in output array
    i = size - 1
    while i >= 0:
        output[count[array[i]] - 1] = array[i]
        count[array[i]] -= 1
        i -= 1

    # Copy the sorted elements into original array
    for i in range(0, size):
        array[i] = output[i]

# Driver Code
data = [4, 2, 2, 8, 3, 3, 1]
countingsort(data)
print("Sorted Array in Ascending Order: ")
print(data)