Efficient algorithms for merging

DOI10.1007/BF01933617zbMath0523.68050OpenAlexW2006931095MaRDI QIDQ1056542

J. Blot

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933617

zbMATH Keywords

top down algorithm23, 410-428 (1983)maximum length of an ordered listoptimal merge lengthoptimal mergingstrong heuristics

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

Efficient algorithms for merging

Cites Work

• Efficient algorithms for merging
• Merging of 4 or 5 elements with n elements
• An improvement of the binary merge algorithm
• Optimal merging of 2 elements with n elements
• On the Optimality of Linear Merge
• Optimal Merging of 3 Elements with n Elements

This page was built for publication: Efficient algorithms for merging