Abstract
Bitonic sorters sort a single bitonic sequence into an ascending sequence. A multi-bitonic sorter is presented here, which sorts k bitonic sequences of n keys each into an ascending sequence in at most \left( {\left\lceil {\log _2 \left( {k + \left\lceil {\frac{k} {2}} \right\rceil } \right)} \right\rceil + 1} \right)\left( {\left\lceil {\log _2 n} \right\rceil - 1} \right)+T(1,k)+\left\lceil {\log _2 k} \right\rceil +1 time delay, where T(1,k) is the time delay needed to sort k keys in order; and k is any integer not restricted to 1.