A simple algorithm for in-place merging

DOI10.1016/J.IPL.2005.11.018zbMath1186.68541OpenAlexW2057671314MaRDI QIDQ844153

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)

Related Items (3)

In-place algorithms for computing (Layers of) maxima ⋮ Line-segment intersection made in-place ⋮ In-Place Parallel Super Scalar Samplesort (IPSSSSo)

Cites Work

• Unnamed Item
• Optimizing stable in-place merging.
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• Asymptotically efficient in-place merging

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