Merging of 4 or 5 elements with n elements
From MaRDI portal
Publication:1157175
DOI10.1016/0304-3975(81)90003-7zbMath0469.68068OpenAlexW2000764889MaRDI QIDQ1157175
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
Related Items (8)
The Ford-Johnson algorithm still unbeaten for less than 47 elements ⋮ A variant of the Ford-Johnson algorithm that is more space efficient ⋮ 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 ⋮ Improved average complexity for comparison-based sorting ⋮ Efficient algorithms for merging
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Merging of 4 or 5 elements with n elements
- Optimal merging of 2 elements with n elements
- Significant Improvements to the Hwang-Lin Merging Algorithm
- The Ford-Johnson Sorting Algorithm Is Not Optimal
- Optimal Detection of Two Complementary Defectives
- A Tournament Problem
This page was built for publication: Merging of 4 or 5 elements with n elements
