Presorting algorithms: An average-case point of view

Theoretical Computer Science

Volumn 242, Issue 1-2, 2000, Pages 29-40

  Hwang, Hsien Kuei ^a   Yang, Bo Yin ^b   Yeh, Yeong Nan ^c  

^a INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

^b TAMKANG UNIVERSITY   (Taiwan)

^c INSTITUTE OF MATHEMATICS   (Taiwan)

Author keywords

Measure of presortedness (mop); Presorting

Indexed keywords

EID: 0242360459     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00181-9     Document Type: Article

References (13)

1. W.H. Burge, Sorting, trees, and measures of order, Inform. and Control 1 (1958) 181-197.
2. P. Diaconis, R.L. Graham, Spearman's footrule as a measure of disarray, J. Roy. Soc. Statist. Ser. B 39 (1977) 262-268.
3. P. Flajolet, M. Golin, Mellin transforms and asymptotics: the mergesort recurrence, Acta Inform. 31 (1994) 673-696.
4. M.A. Fligner, J.S. Verducci (Eds.), Probability models and statistical analysis, for ranking data, Lecture Notes in Statistics, vol. 80, Springer, Berlin, 1993.
5. D.H. Greene, D.E. Knuth, Mathematics for the Analysis of Algorithms, Birkhäuser, Boston, 1981.
6. H.-K. Hwang, Asymptotic expansions of mergesort recurrences, Acta Inform., to appear.
7. D.E. Knuth, The Art of Computer Programming, vol. III, Sorting and Searching. Addison-Wesley, Reading, MA. 1973.
8. C.C. McGeoch, J.D. Tygar, Optimal sampling strategies for quicksort, Random Struct. Algorithms 7 (1995) 287-300.
9. H. Mannila, Measures of presortedness and optimal sorting algorithms, IEEE Trans. Comput. 34 (1985) 318-325.
10. K. Mehlhorn, Sorting presorted files, in: Theoretical Computer Science (4th GI Conference, Aachen, 1979), pp. 199-212, Lecture Notes in Computer Science, vol. 67, Springer Berlin, 1979.
11. O. Petersson, A. Moffat, A framework for adaptive sorting, Discrete Appl. Math. 59 (1995) 153-179.
12. R. Sedgewick, Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1988.
13. J.S. Vitter, P. Flajolet, Average-case analysis of algorithms and data structures, in: Handbook of Theoretical Computer Science, vol. A, Algorithms and Complexity, Elsevier, Amsterdam, 1990, pp. 431-524.