Practical in-place merging

By Bing-Chao Huang, Michael A. Langston

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

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

0 Comments

No entries found

Purchase the Article

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine