Smallest sorting network $S(3)$
The smallest number of comparators in a sorting network on $3$ inputs.
Value: $3$ lower bound Literature upper bound 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 |
|---|---|---|---|
| undated | $\ge 3$ |
Trivial or easy according to the secondary source.
[via R.W. Floyd, D.E. Knuth, The Bose-Nelson sorting problem, Stanford report STAN-CS-70-177, November 1970. Also in A Survey of Combinatorial Theory, North-Holland (1973) 163-172.] |
Literature |
| 1962-04 | $\le 3$ |
R.C. Bose, R.J. Nelson, A sorting problem, Journal of the ACM 9 (1962) 282-296.
[via R.W. Floyd, D.E. Knuth, The Bose-Nelson sorting problem, Stanford report STAN-CS-70-177, November 1970. Also in A Survey of Combinatorial Theory, North-Holland (1973) 163-172.] |
Checked construction
Certificate sorting-network-size-3-upper-3, 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).] |
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.
- $\ge 2$: sorting-network-size-3-lower-2, submitted by daniel-munro, 2026-11-11 Weaker than recorded