Stable Linear Time Sublinear Space Merging

DOI10.1093/COMJNL/30.4.372MaRDI QIDQ3798250zbMATH OpenOpenAlexFDO

Authors

Publication date 1987

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/30.4.372

zbMATH Keywords

stable mergingone-dimensional array

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4001497
• Unstable linear time O(1) space merging
• Simplified stable merging tasks
• Asymptotically efficient in-place merging
• Asymptotically efficient in-place merging

Cited in

(7)

• Space-efficient planar convex hull algorithms
• Unstable linear time O(1) space merging
• A Simple Algorithm for Stable Minimum Storage Merging
• Stable unmerging in linear time and constant space
• Merging by Decomposition Revisited
• scientific article; zbMATH DE number 4001497 (Why is no real title available?)
• Making bubblesort recursive

This page was built for publication: Stable Linear Time Sublinear Space Merging

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