Smallest sorting network $S(26)$

Sorting network on 26 inputs with 138 comparators in 15 steps, drawn as 26 horizontal wires joined by vertical comparators

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

Lower bound: $111$ Literature
Upper bound: $138$ 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 141$ 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 138$, sorting-network-size-26-upper-138
2009-04 $\le 140$ S.W. Al-Haj Baddar, Finding Better Sorting Networks, PhD thesis, Kent State University, 2009. Checked construction
via $\le 138$, sorting-network-size-26-upper-138
2018-01-02 $\ge 102$ B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2018-01-02. Literature
2018-07-18 $\le 139$ B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2018-07-18. Checked construction
via $\le 138$, sorting-network-size-26-upper-138
2020-05-30 $\ge 104$ 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 105$ B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2020-06-07. Literature
2024-10-27 $\le 138$ B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2024-10-27. Checked construction
Certificate sorting-network-size-26-upper-138, 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 111$ 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.