A Fast Merging Algorithm
Mark R. Brown, Robert Endre Tarjan · Journal of the ACM · 1979
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