Skip to main content
Log in

A Tree-based Mergesort

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

We demonstrate that if standard Mergesort is implemented using finger search trees instead of arrays it optimally adapts to a set of measures of presortedness not fulfilled by any other algorithm.

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.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 7 October 1993 / 18 July 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moffat, A., Petersson, O. & Wormald, N. A Tree-based Mergesort. Acta Informatica 35, 775–793 (1998). https://doi.org/10.1007/s002360050142

Download citation

  • Issue Date:

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

Keywords

Navigation