Counting Sort Algorithm Explained with Examples
Published in
6 min readApr 16, 2021
We have seen sorting algorithms in the previous article. In this article, we are going to discuss the Counting Sort Algorithm.
When comparing elements, no sorting algorithm can sort n elements in less than O(n log n) time. Fortunately, if we know some information about the elements ahead of time, we can sort them in other ways. Assume we are asked to sort n elements but are told…
