Papers › Lower Bounds for Sorting 16, 17, and 18 Elements
Lower Bounds for Sorting 16, 17, and 18 Elements
Florian Stober, Armin Weiß
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
It is a long-standing open question to determine the minimum number of comparisons S(n) that suffice to sort an array of n elements. Indeed, before this work S(n) has been known only for n≤22 with the exception for n=16, $17$, and $18$. In this work, we fill that gap by proving that sorting n=16, $17$, and $18$ elements requires $46$, $50$, and $54$ comparisons respectively. This fully determines S(n) for these values and disproves a conjecture by Knuth that S(16) = 45. Moreover, we show that for sorting $28$ elements at least 99 comparisons are needed. We obtain our result via an exhaustive computer search which extends previous work by Wells (1965) and Peczarski (2002, 2004, 2007, 2012). Our progress is both based on advances in hardware and on novel algorithmic ideas such as applying a bidirectional search to this problem.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections