sengupta@ENUXHA.EAS.ASU.EDU (Uttam Sengupta) (03/07/91)
Binary merging is a technique for merging two sorted sequences proposed by F. K. Hwang and S. Lin [SIAM J. of Computing 1972 pp.31-39]. The Art of Computer Programming, Vol. 3 by D. E. Knuth (pp. 205-206) also discusses this algorithm. Would anybody on the net be aware of references to an average case analysis of the Binary merge? Any help/pointers would be much appreciated. Thanks in advance, -Uttam ------------------------------------------------------------------------------- Uttam Sengupta Dept. of Computer Science & Engineering (602) 965-2735 Arizona State University INTERNET : sengupta@enuxha.eas.asu.edu Tempe, AZ 85287