CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search Bitonic sorter Bitonic sort network with eight inputs. Class Sorting algorithm Data structure Array Worst case performance parallel time Best case performance parallel time Average case performance parallel time Worst case space complexity comparators Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network . The algorithm was devised by Ken Batcher . The resulting sorting networks consist of comparators and have a delay of , where is the number of items to be sorted. [ 1 ] A sorted sequence is a monotonically non-decreasing (or non-increasing) sequence. A bitonic sequence is a sequence with for some , or a circular shift of such a sequence. 1 How the algorithm works 2 Example code...