Python: Counting sort algorithm

Last update on April 02 2025 05:26:07 (UTC/GMT +8 hours)

10. Counting Sort

Write a Python program for counting sort.
According to Wikipedia "In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct key value, and using arithmetic on those counts to determine the positions of each key value in the output sequence. Its running time is linear in the number of items and the difference between the maximum and minimum key values, so it is only suitable for direct use in situations where the variation in keys is not significantly greater than the number of items. However, it is often used as a subroutine in another sorting algorithm, radix sort, that can handle larger keys more efficiently".

Sample Solution:

Python Code:

def counting_sort(array1, max_val):
    m = max_val + 1
    count = [0] * m                
    
    for a in array1:
    # count occurences
        count[a] += 1             
    i = 0
    for a in range(m):            
        for c in range(count[a]):  
            array1[i] = a
            i += 1
    return array1

print(counting_sort( [1, 2, 7, 3, 2, 1, 4, 2, 3, 2, 1], 7 ))

Sample Output:

[1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 7] 

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Python program to implement counting sort for a list of non-negative integers and print the sorted output.
• Write a Python script to apply counting sort to sort a list of integers with a small range of values and display the count array.
• Write a Python program to modify counting sort to sort a list of objects based on an integer attribute.
• Write a Python function to implement counting sort and then analyze its time complexity on various input sizes.

Python Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Python program to sort a list of elements using the quick sort algorithm.
Next: Write a Python code to create a program for Bitonic Sort.