Answers are grounded in this paper and cite their sources.
An algonthm that merges sorted hsts represented as height-balanced binary trees 1s given If the hsts have lengths m and n (m _< n) then the merging procedure runs m O(m log(n/m)) steps, which is the same order as the lower bound on all companson-based algorithms for this problem
No takes yet. Share an insight, caveat, or question.
Brown et al. (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: