A Fast Merging Algorithm.

摘要

An algorithm which merges sorted lists is represented as balanced binary tree. If the lists have lengths m and n (m < or = n) then the merging procedure runs in 0 (m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem. (Author)