Cube Sort Parallel Implementation (Comparison Sorting Sorting)

From Algorithm Wiki

Revision as of 11:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O(n)$ words ((can be easily derived)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Parallel RAM == Year == 1992 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0196677492900166?via%3Dihub")

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

Jump to navigation Jump to search

Time Complexity

$O(n logn)$

Space Complexity

$O(n)$ words

((can be easily derived))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Parallel RAM

Year

1992

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0196677492900166?via%3Dihub

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