Pairwise Networks are Superior for Selection

Moshe Zazon-Ivry and Michael Codish   

(submitted); ? (?): ?, 2012


This paper revisits the pairwise sorting network introduced by Parberry in the early 90s. We provide a simple specification of the pairwise network which also clarifies its close resemblance to the more classic odd-even network introduced by Batcher in the mid 60s. Finally we illustrate that pairwise networks are better suited than odd-even networks for the construction of selection networks.

Available:    bibtex entry   pdf

Related sites:

Michael Codish
The Department of Computer Science
Ben-Gurion University of the Negev
PoB 653, Beer-Sheva, 84105, Israel

© copyright notice