Fastest sorting network $D(3)$
The smallest depth, or number of parallel steps, of 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 |
|---|---|---|---|
| 1968-04-30 | $\le 3$ | K.E. Batcher, Sorting networks and their applications, AFIPS Spring Joint Computer Conference 32 (1968) 307-314. |
Checked construction
Certificate sorting-network-depth-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).] |
| 1973 | $\ge 3$ |
D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, 1973, Section 5.3.4.
[via I. Parberry, A computer-assisted optimal depth lower bound for nine-input sorting networks, Mathematical Systems Theory 24 (1991) 101-116.] |
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.
- $\ge 2$: sorting-network-depth-3-lower-2, submitted by daniel-munro, 2026-11-11 Weaker than recorded