A simple linear-time algorithm for in situ merging
Information Processing Letters
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)
Mathematical Foundations of Computer Science 1986
Time-Space Optimal Parallel Merging and Sorting
IEEE Transactions on Computers
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Nordic Journal of Computing
Fast In-Place Verification of Data Dependencies
IEEE Transactions on Knowledge and Data Engineering
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Competitiveness of Linear Search
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Optimizing stable in-place merging
Theoretical Computer Science
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
A simple algorithm for in-place merging
Information Processing Letters
A simple algorithm for in-place merging
Information Processing Letters
A key-address mapping sort algorithm
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Sorting by merging or merging by sorting?
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On optimal and efficient in place merging
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Library support for parallel sorting in scientific computations
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 48.22 |
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.