Spreadsort (Non-Comparison Sorting Sorting): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== 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")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(n*log n)$
$O(n \log n)$


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 08:33, 10 April 2023

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.ezproxy.canberra.edu.au/w/index.php?title=Spreadsort_(Non-Comparison_Sorting_Sorting)&oldid=47313"