Huang & Langston (1988) Practical In-Place Merging

A paper I read because of a mention in StackOverflow about merging two sorted arrays. However, despite it claims that it can merge two lists in \(O(n)\) time and \(O(1)\) space, it seems that it does not work for arrays but linked lists. One key feature of the paper’s \(O(n)\)... [more]