A step by step guide to the Counting Sort algorithm

While all comparison-based algorithms have a time complexity of O(nlogn) to sort an array of n elements, there are sorting algorithms running in linear time provided that some assumptions are verified. Counting sort is one of such algorithms and thi...