| 1970-05 |
$\le 118$
|
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 114$, sorting-network-size-23-upper-114
|
| 2017-12-29 |
$\le 116$
|
B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, first version of sorting_networks.html, 2017-12-29.
|
Checked construction
via $\le 114$, sorting-network-size-23-upper-114
|
| 2018-01-02 |
$\ge 87$
|
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 115$
|
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 114$, sorting-network-size-23-upper-114
|
| 2020-05-30 |
$\ge 89$
|
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 90$
|
B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2020-06-07.
|
Literature
|
| 2022-01-02 |
$\le 114$
|
B. Dobbelaere, Smallest and fastest sorting networks for a given number of inputs, SorterHunter repository, sorting_networks.html, 2022-01-02.
|
Checked construction
Certificate sorting-network-size-23-upper-114,
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 95$
|
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
|