Odd Even Merge Sort
Odd Even Merge Sort Odd even merge sort is a comparison sorting algorithm designed as a sorting network. It uses a fixed pattern of compare and swap operations, independent of the input values. It is closely related to bitonic sort but uses a different merging strategy. It is especially useful in parallel hardware and SIMD execution environments. Problem Given an array $A$ of length $n$, reorder it such that: $$...