Optimal merging of 2 elements with n elements
From MaRDI portal
Publication:2547204
DOI10.1007/BF00289521zbMath0221.05017OpenAlexW1988690071MaRDI QIDQ2547204
Publication date: 1971
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289521
Related Items (10)
The Ford-Johnson algorithm still unbeaten for less than 47 elements ⋮ On the upper bound of the complexity of sorting ⋮ On the optimality of tape merge of two lists with similar size ⋮ Small Complexity Gaps for Comparison-Based Sorting ⋮ Merging of 4 or 5 elements with n elements ⋮ Group testing with two defectives ⋮ An improvement of the binary merge algorithm ⋮ Improved average complexity for comparison-based sorting ⋮ Reaching the bound in the \((2,n)\) merging problem ⋮ Efficient algorithms for merging
Cites Work
This page was built for publication: Optimal merging of 2 elements with n elements
