The Ford-Johnson Sorting Algorithm Is Not Optimal
From MaRDI portal
Publication:4190150
DOI10.1145/322139.322145zbMath0404.68063OpenAlexW2075852544MaRDI QIDQ4190150
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322139.322145
Related Items
The Ford-Johnson algorithm still unbeaten for less than 47 elements, A variant of the Ford-Johnson algorithm that is more space efficient, Small Complexity Gaps for Comparison-Based Sorting, Merging of 4 or 5 elements with n elements, Some modified algorithms for Dijkstra's longest upsequence problem, Some Completeness Results on Decision Trees and Group Testing, On partial sorting in restricted rounds, On the average case of MergeInsertion, Improved average complexity for comparison-based sorting, Significant improvements to the Ford-Johnson algorithm for sorting