Open Access
Translator Disclaimer
November 1996 On tree-growing search strategies
Janice Lent, Hosam M. Mahmoud
Ann. Appl. Probab. 6(4): 1284-1302 (November 1996). DOI: 10.1214/aoap/1035463333

Abstract

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."

Citation

Download Citation

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

Information

Published: November 1996
First available in Project Euclid: 24 October 2002

zbMATH: 0870.60019
MathSciNet: MR1422987
Digital Object Identifier: 10.1214/aoap/1035463333

Subjects:
Primary: 60F05 , 68P10
Secondary: 05C05

Keywords: limit distributions , searching , sorting

Rights: Copyright © 1996 Institute of Mathematical Statistics

JOURNAL ARTICLE
19 PAGES


SHARE
Vol.6 • No. 4 • November 1996
Back to Top