Counting Sort

Internal

• Sorting Algorithms

Overview

TODO CLRS page 194.

The counting sort algorithm assuming that the input keys are in the set {0, 1, ..., k} sorts n keys in Θ(k + n) time.

Worst-case time	Θ(k + n)
Average-case time	Θ(k + n)
Best-case time