BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-77-625
       ENTRY:: June 28, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A fast merging algorithm
        TYPE:: Technical Report
      AUTHOR:: Brown, Mark R.
      AUTHOR:: Tarjan, Robert Endre
        DATE:: August 1977
       PAGES:: 44
    ABSTRACT:: 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.
       NOTES:: [Adminitrivia V1/Prg/19950628]
         END:: STAN//CS-TR-77-625