Average case analysis of the merging algorithm of Hwang and Lin W. Fernandez de la Vega
Download:
|
|
by A. M. Frieze, M. Santha
http://www.math.cmu.edu/~af1p/HL.ps.gz
Add To MetaCart
Abstract:
We derive an asymptotic equivalent to the average running time of the merging algorithm of Hwang and Lin applied on two linearly ordered lists of numbers a1! a2::: ! am and b1! b2::: ! bn when m and n tend to infinity in such a way that the ratio ae =
Citations
| 492 | Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition – Knuth - 1998 |
| 32 | A simple algorithm for merging two disjoint linearly ordered sets – Hwang, Lin - 1972 |
| 11 | Optimal merging of 2 elements with n elements – Barbay, Hwang, et al. - 1971 |
| 7 | Improving the bounds on optimal merging – Christen - 1978 |
| 7 | Probabilistic methods in graph theory – Chvatal - 1984 |
| 2 | Probabilistic Results on Merging – Vega, Kannan, et al. - 1990 |
| 2 | Significant improvements to the Hwang-Ling merging algorithm – Manacher - 1979 |
