# Batcher odd–even mergesort

Class Visualization of the odd–even mergesort network with eight inputs Sorting algorithm Array ${\displaystyle O(\log ^{2}(n))}$ parallel time ${\displaystyle O(\log ^{2}(n))}$ parallel time ${\displaystyle O(\log ^{2}(n))}$ parallel time ${\displaystyle O(n\log ^{2}(n))}$ non-parallel time