Counting Sort

Counting sort is an efficient sorting algorithm that can run in linear time under certain conditions. It is non-comparative and operates by counting the occurrences of each value in the input array. Counting sort is stable, meaning it preserves the relative order of equal elements. However, it has limited applicability as it can only sort non-negative integers and requires additional memory proportional to the range of input values.