Abstract.
This note provides exact formulae for the mean and variance of the cost of top-down recursive mergesort. These formulae improve upon earlier results of Flajolet and Golin.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 11 May 1998
Rights and permissions
About this article
Cite this article
Hwang, HK. Asymptotic expansions of the mergesort recurrences. Acta Informatica 35, 911–919 (1998). https://doi.org/10.1007/s002360050147
Issue Date:
DOI: https://doi.org/10.1007/s002360050147