A simple algorithm for in-place merging

DOI10.1016/J.IPL.2005.11.018MaRDI QIDQ844153zbMATH OpenOpenAlexFDO

Authors Jing-Chao Chen

Publication date 18 January 2010

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

Full work available at URL https://doi.org/10.1016/j.ipl.2005.11.018

zbMATH Keywords

design of algorithmsin-place mergingmergesort

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• The analysis of a simple in-place merging algorithm
• Asymptotically efficient in-place merging
• Asymptotically efficient in-place merging
• An efficient multiway merging algorithm
• SOFSEM 2006: Theory and Practice of Computer Science
• Multiway In-Place Merging
• Multiway in-place merging
• Optimizing stable in-place merging.
• A Simple Algorithm for Stable Minimum Storage Merging

Cites work

• scientific article; zbMATH DE number 3374945 (Why is no real title available?)
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• Asymptotically efficient in-place merging
• Optimizing stable in-place merging.

Cited in

(7)

• SOFSEM 2006: Theory and Practice of Computer Science
• In-place algorithms for computing (Layers of) maxima
• In-place parallel super scalar samplesort (\(\mathrm{IPS}^4\mathrm{o}\))
• The analysis of a simple in-place merging algorithm
• Line-segment intersection made in-place
• Simplified stable merging tasks
• scientific article; zbMATH DE number 1437310 (Why is no real title available?)

This page was built for publication: A simple algorithm for in-place merging

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