Elsevier

Journal of Algorithms

Volume 44, Issue 1, July 2002, Pages 177-225
Journal of Algorithms

An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms

https://doi.org/10.1016/S0196-6774(02)00208-0Get rights and content

Abstract

Cauchy–Euler differential equations surfaced naturally in a number of sorting and searching problems, notably in quicksort and binary search trees and their variations. Asymptotics of coefficients of functions satisfying such equations has been studied for several special cases in the literature. We study in this paper a very general framework for Cauchy–Euler equations and propose an asymptotic theory that covers almost all applications where Cauchy–Euler equations appear. Our approach is very general and requires almost no background on differential equations. Indeed the whole theory can be stated in terms of recurrences instead of functions. Old and new applications of the theory are given. New phase changes of limit laws of new variations of quicksort are systematically derived. We apply our theory to about a dozen of diverse examples in quicksort, binary search trees, urn models, increasing trees, etc.

References (117)

  • H.M. Mahmoud et al.

    Probabilistic analysis of bucket recursive trees

    Theoret. Comput. Sci.

    (1995)
  • C.J.H. McDiarmid et al.

    Large deviations for quicksort

    J. Algorithms

    (1996)
  • J. Pearl

    A space-efficient on-line method of computing quantile estimates

    J. Algorithms

    (1981)
  • P.V. Poblete et al.

    The analysis of a fringe heuristic for binary search trees

    J. Algorithms

    (1985)
  • J. Röhrich

    A hybrid of quicksort with O(nlogn) worst case complexity

    Inform. Process. Lett.

    (1982)
  • S.M. Sarwar et al.

    Engineering quicksort

    Comput. Lang.

    (1996)
  • W.J. Adams

    The Life and Times of the Central Limit Theorem

    (1974)
  • E.A. Albacea

    Leapfrogging samplesort

  • A. Andersson

    General balanced trees

    J. Algorithms

    (1999)
  • C. Ashcraft et al.

    SPOOLES: an object-oriented sparse matrix library

  • J.-L. Baer et al.

    Improving quicksort performance with a codeword data structure

    IEEE Trans. Software Engrg.

    (1989)
  • S. Battiato et al.

    An efficient algorithm for the approximate median selection problem

  • C.M. Bender et al.

    Advanced Mathematical Methods for Scientists and Engineers

    (1999)
  • J.L. Bentley et al.

    Engineering a sort function

    Software–Pract. Exper.

    (1993)
  • J.L. Bentley et al.

    Fast algorithms for sorting and searching strings

  • F. Bergeron et al.

    Varieties of increasing trees

  • P. Billingsley

    Probability and Measure

    (1995)
  • W.H. Burge

    Analysis of a tree sorting method and some properties of a set of trees

  • P.L. Chebyshev
  • W.-M. Chen, H.-K. Hwang, Analysis of two randomized algorithms for finding the maximum in a broadcast communication...
  • H.-H. Chern et al.

    Transitional behaviors of the average cost of quicksort with median-of-(2t+1)

    Algorithmica

    (2001)
  • H.-H. Chern et al.

    Phase changes in random m-ary search trees and generalized quicksort

    Random Structures Algorithms

    (2001)
  • H.-H. Chern et al.

    Distribution of the number of consecutive records

    Random Structures Algorithms

    (2000)
  • L. Comtet

    Advanced Combinatorics. The Art of Finite and Infinite Expansions, revised and enlarged edition

    (1974)
  • C.R. Cook et al.

    Best sorting algorithms for nearly sorted lists

    Comm. ACM

    (1980)
  • T.H. Cormen et al.

    Introduction to Algorithms

    (1990)
  • N.J. Cox

    The ninther and its relatives: summary measures useful in geomorphology

    Z. Geomorph.

    (1992)
  • W. Cunto et al.

    Improving time and space efficiency in generalized binary search trees

    Acta Inform.

    (1987)
  • L. Devroye

    Moment inequalities for random variables in computational geometry

    Computing

    (1983)
  • L. Devroye

    Universal limit laws for depths in random trees

    SIAM J. Comput.

    (1999)
  • L. Devroye

    Limit laws for sums of functions of subtrees of random binary search trees

    SIAM J. Comput.

    (2002)
  • L. Devroye et al.

    Perfect simulation from the quicksort limit distribution

    Electron. Comm. Probab.

    (2000)
  • P. Diaconis

    Application of the method of moments in probability and statistics

  • F. Dionisi et al.

    Supercritical CO2 extraction for total fat analysis of food products

    J. Food Sci.

    (1999)
  • R.G. Dromey

    Exploiting partial order with quicksort

    Software—Pract. Exp.

    (1984)
  • Phase Transitions in Combinatorial Problems

    Theoret. Comput. Sci.

    (2001)
  • M. Durand, Holonomie et applications en l'analyse d'algorithmes et combinatoire, DEA Mémoire, LIX, École Polytechnique,...
  • B. Durian

    Quicksort without a stack

  • J.A. Fill

    On the distribution of binary search trees under the random permutation model

    Random Structures Algorithms

    (1996)
  • J.A. Fill, Transfer theorems and asymptotic distributional results for m-ary search trees, manuscript,...
  • Cited by (0)

    1

    Partially supported by National Science Council of ROC under the Grant NSC-90-2115-M-133-001.

    2

    Partially supported by National Science Council of ROC under the Grants NSC-90-2118-M-001-034 and NSC-90-2118-M-001-028.

    View full text