Counting Sort: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Sorting Algorithms =Overview=") |
|||
| Line 4: | Line 4: | ||
=Overview= | =Overview= | ||
<font color=darkgray>The counting sort algorithm assuming that the input keys are in the set {0, 1, ..., k} sorts n keys in Θ(k + n) time.<font> | |||
Revision as of 00:43, 10 August 2018
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.