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.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: 7 October 1993 / 18 July 1996
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s002360050142