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

DOI10.1016/J.IPL.2006.11.017zbMath1184.68660OpenAlexW1998757079WikidataQ58001488 ScholiaQ58001488MaRDI QIDQ846008

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

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

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

Related Items (3)

Small Complexity Gaps for Comparison-Based Sorting ⋮ On partial sorting in restricted rounds ⋮ Improved average complexity for comparison-based sorting

Cites Work

• Unnamed Item
• Unnamed Item
• Merging of 4 or 5 elements with n elements
• Electronic Data Sorting
• The Ford-Johnson Sorting Algorithm Is Not Optimal
• A Tournament Problem

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