Smallest sorting network $S(12)$
The smallest number of comparators in a sorting network on $12$ inputs.
Value: $39$
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 |
| 1962-04 |
$\le 42$
|
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
via $\le 39$, sorting-network-size-12-upper-39
|
| 1964-09 |
$\le 41$
|
K.E. Batcher, A new internal sorting method, Goodyear Aerospace report GER-11759, September 1964.
[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
via $\le 39$, sorting-network-size-12-upper-39
|
| 1970-11 |
$\ge 31$
|
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
|
| 1970-11 |
$\le 39$
|
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-12-upper-39,
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).]
|
| 1972-06 |
$\ge 35$
|
D.C. Van Voorhis, An improved lower bound for sorting networks, IEEE Transactions on Computers C-21 (1972) 612-613.
[via M. Codish, L. Cruz-Filipe, M. Frank, P. Schneider-Kamp, Twenty-five comparators is optimal when sorting nine inputs (and twenty-nine for ten), ICTAI 2014, arXiv:1405.5754. Also Journal of Computer and System Sciences 82 (2016) 551-563.]
|
Literature
|
| 2014-05-22 |
$\ge 37$
|
M. Codish, L. Cruz-Filipe, M. Frank, P. Schneider-Kamp, Twenty-five comparators is optimal when sorting nine inputs (and twenty-nine for ten), ICTAI 2014, arXiv:1405.5754. Also Journal of Computer and System Sciences 82 (2016) 551-563.
|
Literature
|
| 2019-12-07 |
$\ge 39$
|
J. Harder, sortnetopt, https://github.com/jix/sortnetopt, 2019-12-07.
[via J. Harder, An answer to the Bose-Nelson sorting problem for 11 and 12 channels, arXiv:2012.04400.]
|
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.