Optimal expected-time algorithms for merging

DOI10.1016/0196-6774(86)90026-XzbMath0637.68066MaRDI QIDQ3777464

No author found.

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

mergingOptimal expected-time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (3)

On the optimality of tape merge of two lists with similar size ⋮ Small Complexity Gaps for Comparison-Based Sorting ⋮ Improved average complexity for comparison-based sorting

This page was built for publication: Optimal expected-time algorithms for merging