Sorting AlgorithmsCounting Sort
Counting Sort
Counts occurrences of each key and uses prefix sums to place elements directly — O(n + k), no comparisons.
Intermediatenon-comparisonstablelinearinteger keys
Loading visualization…
Counts occurrences of each key and uses prefix sums to place elements directly — O(n + k), no comparisons.