Batcher odd-even mergesort
From Wikipedia, the free encyclopedia
Batcher's odd-even mergesort is a generic construction devised by Ken Batcher for sorting networks of size 2n. Unlike a mergesort, this algorithm is not data-dependent.
It is popularised by the first GPU Gems book, as an easy way of doing reasonably efficient sorts on graphics-processing hardware.
