×

zbMATH — the first resource for mathematics

A simple algorithm for in-place merging. (English) Zbl 1186.68541
Summary: 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 V. Geffert, J. Katajainen and T. Pasanen [“Asymptotically efficient in-place merging”, Theor. Comput. Sci. 237, No. 1–2, 159–181 (2000; Zbl 0939.68160)]. The simplified algorithm is simple yet practical, and has a small time complexity.

MSC:
68W05 Nonnumerical algorithms
68P10 Searching and sorting
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Chen, J.C., Optimizing stable in-place merging, Theoret. comput. sci., 302, 191-210, (2003) · Zbl 1051.68050
[2] Geffert, V.; Katajainen, J.; Pasanen, T., Asymptotically efficient in-place merging, Theoret. comput. sci., 237, 159-181, (2000) · Zbl 0939.68160
[3] Huang, B.-C.; Langston, M.A., Practical in-place merging, Comm. ACM, 31, 348-352, (1988)
[4] Huang, B.-C.; Langston, M.A., Fast stable merging and sorting in constant extra space, Comput. J., 35, 643-650, (1992)
[5] Hwang, F.K.; Lin, S., A simple algorithm for merging two disjoint linearly ordered sets, SIAM J. comput., 1, 31-39, (1972) · Zbl 0235.68015
[6] Katajainen, J.; Pasanen, T.; Teuhola, J., Practical in-place mergesort, Nordic J. comput., 3, 27-40, (1996)
[7] Kronrod, M.A., An optimal ordering algorithm without operational field, Soviet math. dokl., 10, 744-746, (1969) · Zbl 0236.68017
[8] Mannila, H.; Ukkonen, E., A simple linear-time algorithm for in situ merging, Inform. process. lett., 18, 203-208, (1984)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.