Pairwise sorting network
Encyclopedia
The Pairwise sorting network is a sorting network
discovered and published by Ian Parberry in 1992. The pairwise sorting network has the same cost (number of comparators) and delay as the odd-even mergesort network
. It requires
comparators and has depth 
.
Sorting network
A sorting network is an abstract mathematical model of a network of wires and comparator modules that is used to sort a sequence of numbers. Each comparator connects two wires and sorts the values by outputting the smaller value to one wire, and the larger to the other...
discovered and published by Ian Parberry in 1992. The pairwise sorting network has the same cost (number of comparators) and delay as the odd-even mergesort network
Batcher odd-even mergesort
Batcher's odd–even mergesort is a generic construction devised by Ken Batcher for sorting networks of size O and depth O, where n is the number of items to be sorted...
. It requires
comparators and has depth .External links
- Sorting Networks – Web page by the author.