The analysis of a simple in-place merging algorithm

DOI10.1016/0196-6774(89)90034-5MaRDI QIDQ4730784zbMATH OpenOpenAlexFDO

Authors Renzo Sprugnoli

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0196-6774(89)90034-5

zbMATH Keywords

divide and conquermerging algorithmaverage running time

Mathematics Subject Classification ID

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

Recommendations

• A simple algorithm for in-place merging
• Asymptotically efficient in-place merging
• Asymptotically efficient in-place merging
• Average-case analysis of the merging algorithm of Hwang and Lin
• SOFSEM 2006: Theory and Practice of Computer Science

Cited in

(3)

• SOFSEM 2006: Theory and Practice of Computer Science
• An improved analysis of linear mergers
• A simple algorithm for in-place merging

This page was built for publication: The analysis of a simple in-place merging algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4730784)