Merging of 4 or 5 elements with n elements

DOI10.1016/0304-3975(81)90003-7MaRDI QIDQ1157175zbMATH OpenOpenAlexFDO

Authors Juergen Schulte Moenting

Publication date 1981

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(81)90003-7

zbMATH Keywords

Ford-Johnson-sortingminimum-comparison-merging

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Reaching the bound in the \((2,n)\) merging problem
• The Ford-Johnson algorithm still unbeaten for less than 47 elements
• Bounds on the size of merging networks
• scientific article; zbMATH DE number 17819
• Some minimum merging networks

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3574969 (Why is no real title available?)
• scientific article; zbMATH DE number 3342010 (Why is no real title available?)
• A Tournament Problem
• Merging of 4 or 5 elements with n elements
• Optimal Detection of Two Complementary Defectives
• Optimal merging of 2 elements with n elements
• Significant Improvements to the Hwang-Lin Merging Algorithm
• The Ford-Johnson Sorting Algorithm Is Not Optimal

Cited in

(7)

• Small Complexity Gaps for Comparison-Based Sorting
• A variant of the Ford-Johnson algorithm that is more space efficient
• The Ford-Johnson algorithm still unbeaten for less than 47 elements
• Merging of 4 or 5 elements with n elements
• On the upper bound of the complexity of sorting
• On the optimality of tape merge of two lists with similar size
• Efficient algorithms for merging

This page was built for publication: Merging of 4 or 5 elements with n elements

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