The Ford-Johnson algorithm still unbeaten for less than 47 elements

DOI10.1016/j.ipl.2006.09.001zbMath1185.68881DBLPjournals/ipl/Peczarski07OpenAlexW2081463407WikidataQ30040050 ScholiaQ30040050MaRDI QIDQ845913

Marcin Peczarski

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.09.001

zbMATH Keywords

sortinganalysis of algorithmsmerging

Mathematics Subject Classification ID

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

Related Items (6)

On the upper bound of the complexity of sorting ⋮ Small Complexity Gaps for Comparison-Based Sorting ⋮ Posets with seven linear extensions sortable by three comparisons ⋮ On partial sorting in restricted rounds ⋮ On the average case of MergeInsertion ⋮ Improved average complexity for comparison-based sorting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the number of mergings with constraints
• Merging of 4 or 5 elements with n elements
• New results in minimum-comparison sorting
• Optimal merging of 2 elements with n elements
• On the Optimality of Linear Merge
• The Ford-Johnson Sorting Algorithm Is Not Optimal
• A Tournament Problem

This page was built for publication: The Ford-Johnson algorithm still unbeaten for less than 47 elements