Toward a Lower Bound for Sorting Networks

  • David C. Van Voorhis
Part of the The IBM Research Symposia Series book series (IRSS)


A sorting network for N items, or an N-sorter, is a circuit with inputs I = {i1, i2, ..., iN} and outputs Ø = {o1, o2, ..., oN}, such that Ø is a monotonically increasing permutation of I. Sorting networks can be constructed using ranks of a basic cell called a comparator, which is essentially a 2-sorter. For example, the 4-sorter depicted in Fig. 1 employs five comparators, which all emit their larger input on their higher output lead.


Binary Tree Longe Path Large Input Asymptotic Growth Branch Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Press, New York 1972

Authors and Affiliations

  • David C. Van Voorhis
    • 1
  1. 1.Advanced Systems Development Division LaboratoryInternational Business Machines CorporationLos GatosUSA

Personalised recommendations