Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting)

From Algorithm Wiki

Revision as of 09:33, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(\log^{2} n)$

Space Complexity

$O({1})$ words

(Paper claims "logspace uniform", so with O(log n) words, this is constant # of words)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

PRAC (shared-memory multiprocessor of the EREW PRAM variety)

Year

1968

Reference

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

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