The Annals of Applied Probability

On tree-growing search strategies

Janice Lent and Hosam M. Mahmoud

Full-text: Open access


Using the concept of a "tree-growing" search strategy, we prove that for most practical insertion sorting algorithms, the number of comparisons needed to sort n keys has asymptotically normal behavior. We prove and apply a sufficient condition for asymptotically normal behavior. The condition specifies a relationship between the variance of the number of comparisons and the rate of growth in height of the sequence of trees that the search strategy "grows."

Article information

Ann. Appl. Probab., Volume 6, Number 4 (1996), 1284-1302.

First available in Project Euclid: 24 October 2002

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60F05: Central limit and other weak theorems 68P10: Searching and sorting
Secondary: 05C05: Trees

Searching sorting limit distributions


Lent, Janice; Mahmoud, Hosam M. On tree-growing search strategies. Ann. Appl. Probab. 6 (1996), no. 4, 1284--1302. doi:10.1214/aoap/1035463333.

Export citation


  • BILLINGSLEY, P. 1986. Probability and Measure. Wiley, New York. Z.
  • DOBERKAT, E. 1982. Asy mptotic estimates for the higher moments of the expected behavior of straight insertion sort. Inform. Process. Lett. 14 179 182. Z.
  • FRITSCH, F., SCHAFER, R. and CROWLEY, W. 1973. Solution of the transcendental equation e x. Comm. ACM 16 123 124. Z.
  • GONNET, G. and BAEZA-YATES, R. 1991. Handbook of Algorithms and Data Structures, 2nd ed. Addison-Wesley, Reading, MA. Z.
  • HU, T. and WACHS, M. 1987. Binary search on a tape. SIAM J. Comput. 16 573 590. Z.
  • KNUTH, D. 1973. The Art of Computer Programming 3. Addison-Wesley, Reading, MA. Z.
  • PANNY, W. 1986. A note on the higher moments of the expected behavior of straight insertion sort. Inform. Process. Lett. 22 175 177.
  • WASHINGTON, DC 20052 E-MAIL: lent