Optimizing stable in-place merging.

DOI10.1016/S0304-3975(02)00775-2zbMath1051.68050MaRDI QIDQ1401325

Jing-Chao Chen

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

sortingin-place algorithmsstable merging

Mathematics Subject Classification ID

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

Related Items (4)

A simple algorithm for in-place merging ⋮ In-place algorithms for computing (Layers of) maxima ⋮ Line-segment intersection made in-place ⋮ Multiway in-place merging

Cites Work

• On a stable minimum storage merging algorithm
• Simplified stable merging tasks
• Stable Sorting and Merging with Optimal Space and Time Bounds
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• Asymptotically efficient in-place merging
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimizing stable in-place merging.