| 1970-05 |
$\le 110$
|
W.H. Kautz, M.C. Pease, M.W. Green, Cellular logic-in-memory arrays, Final Report Part 1, SRI Project 5509, Stanford Research Institute, May 1970.
[via 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 106$, sorting-network-size-22-upper-106
|
| 2010-08 |
$\le 108$
|
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 106$, sorting-network-size-22-upper-106
|
| 2018-01-02 |
$\ge 82$
|
B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2018-01-02.
|
Literature
|
| 2018-01-02 |
$\le 107$
|
B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2018-01-02.
|
Checked construction
via $\le 106$, sorting-network-size-22-upper-106
|
| 2020-05-30 |
$\ge 84$
|
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 85$
|
B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2020-06-07.
|
Literature
|
| 2022-01-15 |
$\le 106$
|
B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2022-01-15.
|
Checked construction
Certificate sorting-network-size-22-upper-106,
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 89$
|
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
|