On a stable minimum storage merging algorithm

DOI10.1016/0020-0190(81)90065-XzbMath0453.68037MaRDI QIDQ1149257

Andrzej Dydek, Krzysztof Dudzinski

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmsstable merging

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (5)

Optimizing stable in-place merging. ⋮ Making bubblesort recursive ⋮ Integrating Pareto optimization into dynamic programming ⋮ Multiway in-place merging ⋮ Asymptotically efficient in-place merging

Cites Work

• Unnamed Item
• Unnamed Item
• Stable Sorting and Merging with Optimal Space and Time Bounds
• A Fast Merging Algorithm

This page was built for publication: On a stable minimum storage merging algorithm