Reaching the bound in the \((2,n)\) merging problem

DOI10.1016/S0020-0255(98)10007-5zbMath0951.68023OpenAlexW1996296446MaRDI QIDQ1818797

Amr Elmasry, Ahmed A. Belal

Publication date: 4 January 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(98)10007-5

zbMATH Keywords

merging problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Optimal merging of 2 elements with n elements

This page was built for publication: Reaching the bound in the \((2,n)\) merging problem