A variant of the Ford-Johnson algorithm that is more space efficient

DOI10.1016/J.IPL.2006.11.017MaRDI QIDQ846008zbMATH OpenOpenAlexWikidataFDO

Authors Mauricio Ayala-Rincón, Bruno T. de Abreu, José de Siqueira

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.11.017

zbMATH Keywords

algorithmsanalysis of algorithmsoptimal sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• The Ford-Johnson algorithm still unbeaten for less than 47 elements
• Significant improvements to the Ford-Johnson algorithm for sorting
• On the average case of MergeInsertion
• On the average case of MergeInsertion
• Quadripartite Sort

Cites work

• A Tournament Problem
• Electronic Data Sorting
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1513875 (Why is no real title available?)
• Merging of 4 or 5 elements with n elements
• The Ford-Johnson Sorting Algorithm Is Not Optimal

Cited in

(5)

• Significant improvements to the Ford-Johnson algorithm for sorting
• A new variant of the \(A^*\)-algorithm which closes a node at most once.
• On partial sorting in restricted rounds
• Small Complexity Gaps for Comparison-Based Sorting
• The Ford-Johnson algorithm still unbeaten for less than 47 elements

This page was built for publication: A variant of the Ford-Johnson algorithm that is more space efficient

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