Parallel Merge Sort - Cole (2) ( Sorting - Comparison)

From Algorithm Wiki

Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(logn)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM == Year == 1988 == Reference == https://epubs.siam.org/doi/abs/10.1137/0217049")

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

Jump to navigation Jump to search

Time Complexity

$O(logn)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

EREW PRAM

Year

1988

Reference

https://epubs.siam.org/doi/abs/10.1137/0217049

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Parallel_Merge_Sort_-_Cole_(2)_(_Sorting_-_Comparison)&oldid=45017"