In-Place Merging Algorithms

  • Denham Coates-Evelyn
  • Published 2004


In this report we consider the problem of merging two sorted lists of m and n keys each in-place. We survey known techniques for this problem, focussing on correctness and the attributes of Stability and Practicality. We demonstrate a class of unstable in-place merge algorithms that uses block rearrangement and internal buffering that actually does not… (More)

10 Figures and Tables


  • Presentations referencing similar topics