Counting Sort (Non-Comparison Sorting Sorting)

From Algorithm Wiki

Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n+k)$ == Space Complexity == $O(n+k)$ words ((can be easily derived)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1954 == Reference == http://bitsavers.org/pdf/mit/whirlwind/R-series/R-232_Information_Sorting_in_the_Application_of_Electronic_Digital_Computers_to_Business_Operations_May54.pdf")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n+k)$

Space Complexity

$O(n+k)$ words

((can be easily derived))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1954

Reference

http://bitsavers.org/pdf/mit/whirlwind/R-series/R-232_Information_Sorting_in_the_Application_of_Electronic_Digital_Computers_to_Business_Operations_May54.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Counting_Sort_(Non-Comparison_Sorting_Sorting)&oldid=44381"