arXiv (All)
open access
Selecting the 7th Smallest of 16 Elements Takes Exactly 28 Comparisons
Let $V_i(n)$ denote the minimum worst-case number of comparisons needed to find the $i$-th smallest of $n$ distinct elements. We construct algorithms showing $V_7(16)\le28$ and $V_8(16)\le29$, improving the previously reported upper bounds of 30 and 31. Together with known lower bounds, these result
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal Shallow Circuits for Majority#1119102
- Wild number for spanning trees in complete and complete bipartite graphs#1357797
- On Circuit Imbalance and 0/1 Circuits for Coloring and Forest Problems#1104404
- Graph Sensitivity of Cartesian Products with Matched Bridges#1233522
- Sharp quantitative Talenti's inequality in particular cases#163102
Record · ID 1344237
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive