Practical in-place merging

Authors:
B.-C. Huang;M. A. Langston
Affiliations:
Department of Computer Science, Washington State University, Pullman, WA;Department of Computer Science, Washington State University, Pullman, WA
Venue:
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Year:
1987

Citing 6
Cited 0

A simple linear-time algorithm for in situ merging

Information Processing Letters
Towards an efficient merging

Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Stable duplicate-key extraction with optimal time and space bounds

Acta Informatica
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Stable Sorting in Asymptotically Optimal Time and Extra Space

Journal of the ACM (JACM)
Fast Stable Merging and Sorting in Constant Extra Space

Fast Stable Merging and Sorting in Constant Extra Space

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive with merge routines free to squander unbounded additional memory, making it particularly attractive whenever space is a critical resource.