Presorting algorithms: An average-case point of view
- 1 July 2000
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 242 (1-2) , 29-40
- https://doi.org/10.1016/s0304-3975(98)00181-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Asymptotic expansions of the mergesort recurrencesActa Informatica, 1998
- Optimal sampling strategies for quicksortRandom Structures & Algorithms, 1995
- A framework for adaptive sortingDiscrete Applied Mathematics, 1995
- Mellin transforms and asymptoticsActa Informatica, 1994
- Probability Models and Statistical Analyses for Ranking DataPublished by Springer Nature ,1993
- Measures of Presortedness and Optimal Sorting AlgorithmsIEEE Transactions on Computers, 1985
- Sorting presorted filesPublished by Springer Nature ,1979
- Spearman's Footrule as a Measure of DisarrayJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977
- Sorting, trees, and measures of orderInformation and Control, 1958