bitonic sort(algorithm) Definition: Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged. Also known as Batcher sort. Generalization (I am a kind of ...) oblivious algorithm. Note: This takes O((log n)2/2) stages (or steps) with n/2 comparators at each stage. This sorts increasingly larger intermingled subsets, somewhat like Shell sort, and merges subsets, like merge s
