Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting)
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.ezproxy.canberra.edu.au/doi/abs/10.1137/0218014