The Ford-Johnson Sorting Algorithm Is Not Optimal

DOI10.1145/322139.322145MaRDI QIDQ4190150zbMATH OpenOpenAlexFDO

Authors Glenn K. Manacher

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

zbMATH Keywords

Ford-Johnson Sorting AlgorithmMerging

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited in

(9)

• Significant improvements to the Ford-Johnson algorithm for sorting
• Merging of 4 or 5 elements with n elements
• Some modified algorithms for Dijkstra's longest upsequence problem
• On partial sorting in restricted rounds
• Some Completeness Results on Decision Trees and Group Testing
• On the average case of MergeInsertion
• Small Complexity Gaps for Comparison-Based Sorting
• The Ford-Johnson algorithm still unbeaten for less than 47 elements
• A variant of the Ford-Johnson algorithm that is more space efficient

This page was built for publication: The Ford-Johnson Sorting Algorithm Is Not Optimal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190150)