Spreadsort (Non-Comparison Sorting Sorting)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$? words

((can be easily derived?))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2002

Reference

https://www.semanticscholar.org/paper/The-Spreadsort-High-performance-General-case-Ross/41f5b49e9843b2d98b6b22a84924dae5761e6e52

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Spreadsort_(Non-Comparison_Sorting_Sorting)&oldid=47313"