RESEARCH CONTRIBUTIONS Algorithms and Data Structures Practical In-Place Merging
by
Bing-chao Huang
,
Michael A. Langston
BibTeX
@MISC{Huang_researchcontributions,
author = {Bing-chao Huang and Michael A. Langston},
title = {RESEARCH CONTRIBUTIONS Algorithms and Data Structures Practical In-Place Merging},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT: We present a novel, yet straightfotward 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.
Citations
| 5 | Haikala,“Virtual Memory Behavior of Some Sorting Algorithms - Alanko, Erkio, et al. - 1984 |
| 1 | Towards an efficient merging - unknown authors |
