Smallest sorting network $S(18)$

Sorting network on 18 inputs with 77 comparators in 12 steps, drawn as 18 horizontal wires joined by vertical comparators

The smallest number of comparators in a sorting network on $18$ inputs.

Lower bound: $68$ Literature
Upper bound: $77$ Checked construction

History

Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.

Date Bound Discovery Best evidence
1971-08 $\le 79$ D.C. Van Voorhis, A generalization of the divide-sort-merge strategy for sorting networks, Technical Report 16, Digital Systems Laboratory, Stanford University (STAN-CS-71-237), August 1971. Checked construction
via $\le 77$, sorting-network-size-18-upper-77
2010-08 $\le 78$ V.K. Valsalam, Utilizing Symmetry in Evolutionary Design, PhD thesis, University of Texas at Austin, Technical Report AI-10-04, August 2010.
[via V.K. Valsalam, R. Miikkulainen, Using symmetry and evolutionary search to minimize sorting networks, Journal of Machine Learning Research 14 (2013) 303-331.]
Checked construction
via $\le 77$, sorting-network-size-18-upper-77
2018-01-02 $\ge 62$ B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2018-01-02. Literature
2020-05-30 $\ge 64$ B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2020-05-30. Literature
2020-06-07 $\ge 65$ B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2020-06-07. Literature
2020-07-04 $\le 77$ B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2020-07-04. Checked construction
Certificate sorting-network-size-18-upper-77, submitted by daniel-munro, 2026-11-11
[construction from B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, https://bertdobbelaere.github.io/sorting_networks.html (page updated 2026-10-10, retrieved 2026-11-11).]
2026-10-18 $\ge 68$ T.S. Tomar, Sorting networks on 13 inputs need at least 44 comparators, Zenodo, 2026, https://doi.org/10.5281/zenodo.23453293.
[via B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2025-04-21.]
Literature

Other certificates

Certificates that aren't the best evidence for any bound above: other certificates are stronger evidence for the same bounds, or they prove only bounds weaker than any recorded.