Counting Sort

From NovaOrdis Knowledge Base
Revision as of 00:56, 10 August 2018 by Ovidiu (talk | contribs) (→‎Overview)
Jump to navigation Jump to search

Internal

Overview

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