A simple algorithm for in-place merging

Authors:
Jing-Chao Chen
Affiliations:
Department of Communication, Donghua University, Shanghai, P.R. China
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 1

A simple linear-time algorithm for in situ merging

Information Processing Letters
Practical in-place merging

Communications of the ACM
Asymptotically efficient in-place merging

Theoretical Computer Science
Practical in-place mergesort

Nordic Journal of Computing
Optimizing stable in-place merging

Theoretical Computer Science

Line-segment intersection made in-place

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

The early algorithms for in-place merging were mainly focused on the time complexity, whereas their structures themselves were ignored. Most of them therefore are elusive and of only theoretical significance. For this reason, the paper simplifies the unstable in-place merge by Geffert et al. [V. Geffert, J. Katajainen, T. Pasanen, Asymptotically efficient in-place merging, Theoret. Comput. Sci. 237 (2000) 159-181]. The simplified algorithm is simple yet practical, and has a small time complexity.