A Bitonic sorter takes a bitonic sequence as an input and the output is a sorted list. I want to analyse Bitonic Sorter by knowing its depth/runtime. Can anyone give an idea on its recurreence formula? Thanks.
$\begingroup$
$\endgroup$
-
$\begingroup$ iti.fh-flensburg.de/lang/algorithmen/sortieren/bitonic/… $\endgroup$ – Yuval Filmus Aug 18 '19 at 17:51
