Spaghetti Sort Parallel Implementation (Non-Comparison Sorting Sorting)
Revision as of 11:42, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary? per processor? words (Assuming getting the spaghetti rods doesn't take up any auxiliary space, the only auxiliary space in this algorithm involves the table and the hands, each using O(1) space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == ??? == Year == 1984 == Reference == https://link.springer.com/chapter/10.1007...")
Time Complexity
$O(n)$
Space Complexity
$O({1})$ auxiliary? per processor? words
(Assuming getting the spaghetti rods doesn't take up any auxiliary space, the only auxiliary space in this algorithm involves the table and the hands, each using O(1) space)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
???
Year
1984
Reference
https://link.springer.com/chapter/10.1007/978-94-009-2794-0_11