An improvement of the binary merge algorithm

DOI10.1007/BF01934409zbMath0493.68071MaRDI QIDQ1168745

S. Singh

Publication date: 1982

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithms22, 454-462 (1982)Hwang-Lin merging algorithm

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (4)

On the optimality of tape merge of two lists with similar size ⋮ Expected time analysis of interpolation merge -- a simple new merging algorithm ⋮ Efficient algorithms for merging ⋮ Significant improvements to the Ford-Johnson algorithm for sorting

Cites Work

• Unnamed Item
• Optimal merging of 2 elements with n elements
• On the Optimality of Linear Merge
• Optimal Merging of 3 Elements with n Elements
• Significant Improvements to the Hwang-Lin Merging Algorithm
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets

This page was built for publication: An improvement of the binary merge algorithm