A simple algorithm for in-place merging

DOI10.1016/J.IPL.2005.11.018zbMATH Open1186.68541OpenAlexW2057671314MaRDI QIDQ844153FDOQ844153

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

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

zbMATH Keywords

design of algorithmsin-place mergingmergesort

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• Optimizing stable in-place merging.
• Asymptotically efficient in-place merging

Cited In (7)

• Simplified stable merging tasks
• In-Place Parallel Super Scalar Samplesort (IPSSSSo)
• In-place algorithms for computing (Layers of) maxima
• Line-segment intersection made in-place
• SOFSEM 2006: Theory and Practice of Computer Science
• The analysis of a simple in-place merging algorithm
• Title not available (Why is that?)

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)