You are on page 1of 11
Parallel Sorting Algorithms — Bitonic Merge Definition 10.1. A bitonic sequence is a sequence of values ao, ...,@n—1, with the property that (1) there exists an index ?, where 0 A 5 : : z > lt}. x c 6 D B BH 5 D c A c : . : 5 5 ~ n Lie D K [+] ¢ D E G SG G dD Ee E : : z : : oe Els A F 5 ots ra ros A 7 : 5 : - : : a td 5 A x H H Bitonic merge-sort of an unsorted list of eight elements. Initial values: ‘After first iteration ‘After third iteration ‘After fourth iteration ‘After fifth iteration ‘After sixth iteration After seventh iteration Parallel Sorting Algorithms — Bitonic Merge—Sort

You might also like