Answers are grounded in this paper and cite their sources.
It is shown that log₂(n!) + o(n) pairwise comparisons is sufficient for sorting any subset of n elements of a linearly ordered set.
No takes yet. Share an insight, caveat, or question.
I. S. Sergeev (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: