Skip to main content
Log in

Asymptotic expansions of the mergesort recurrences

  • Published:
Acta Informatica Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 11 May 1998

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050147

Keywords

Navigation