Affiliation:
1. Washington State Univ., Pullman
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.
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. Virtual Memory Behavior of Some Sorting Algorithms
2. Stable Sorting in Asymptotically Optimal Time and Extra Space
3. Huang B.C. and Langston M.A. Stable duplicate-key extraction with optimal time and space hounds. Acta lnformatica to appear. 10.1007/BF00289147 Huang B.C. and Langston M.A. Stable duplicate-key extraction with optimal time and space hounds. Acta lnformatica to appear. 10.1007/BF00289147
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献