On optimal and efficient in place merging

Authors:
Pok-Son Kim;Arne Kutzner
Affiliations:
Department of Mathematics, Kookmin University, Seoul, Rep. of Korea;Department of E-Business, Seokyeong University, Seoul, Rep. of Korea
Venue:
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Year:
2006

Citing 7
Cited 2

A simple linear-time algorithm for in situ merging

Information Processing Letters
Simplified stable merging tasks

Journal of Algorithms
Practical in-place merging

Communications of the ACM
Programming pearls (2nd ed.)

Programming pearls (2nd ed.)
Asymptotically efficient in-place merging

Theoretical Computer Science
Introduction to Algorithms

Introduction to Algorithms
Optimizing stable in-place merging

Theoretical Computer Science

A Simple Algorithm for Stable Minimum Storage Merging

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Ratio based stable in-place merging

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new stable in place merging algorithm that needs O(mlog$(\frac{n}{m}+1))$ comparisons and O(m+n) assignments. According to the lower bounds for merging our algorithm is asymptotically optimal regarding the number of comparisons as well as assignments. The stable algorithm is developed in a modular style out of an unstable kernel for which we give a definition in pseudocode. The literature so far describes several similar algorithms but merely as sophisticated theoretical models without any reasoning about their practical value. We report specific benchmarks and show that our algorithm is for almost all input sequences faster than the efficient minimum storage algorithm by Dudzinski and Dydek. The proposed algorithm can be effectively used in practice.