| 1962-04 |
$\le 55$
|
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 51$, sorting-network-size-14-upper-51
|
| 1964-09 |
$\le 53$
|
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 51$, sorting-network-size-14-upper-51
|
| 1970-11 |
$\ge 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.
|
Literature
|
| 1970-11 |
$\le 51$
|
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-14-upper-51,
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 43$
|
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 45$
|
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
|
| 2020-05-30 |
$\ge 47$
|
B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2020-05-30.
|
Literature
|
| 2026-10-18 |
$\ge 48$
|
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
|