A representation for linear lists with movable fingers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We give an algorithm which merges sorted lists represented as balanced binary trees. If the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem.