Home → Magazine Archive → March 1988 (Vol. 31, No. 3) → Practical in-place merging → Abstract

Practical in-place merging

By Bing-Chao Huang, Michael A. Langston

Communications of the ACM, Vol. 31 No. 3, Pages 348-352

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.

The full text of this article is premium content


No entries found