Burst Sort (Non-Comparison Sorting Sorting)

From Algorithm Wiki

Revision as of 10:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(wn)$ == Space Complexity == $O(wn)$ words ((wikipedia page?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?doid=1005813.1041517")

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

Jump to navigation Jump to search

Time Complexity

$O(wn)$

Space Complexity

$O(wn)$ words

((wikipedia page?))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?doid=1005813.1041517

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