Open Access
Translator Disclaimer
February 1998 Normality of tree-growing search strategies
Russell Lyons, Kevin Zumbrun
Ann. Appl. Probab. 8(1): 112-130 (February 1998). DOI: 10.1214/aoap/1027961036

Abstract

We study the class of tree-growing search strategies introduced by Lent and Mahmoud, searches for which data are stored in a deterministic sequence of tree structures (e.g., linear search in forward order). Specifically, we study the conditions under which the number of comparisons needed to sort a sequence of randomly ordered numbers is asymptotically normal. Our main result is a sufficient condition for normality in terms of the growth rate of tree height alone; this condition is easily computed and is satisfied by all standard deterministic search strategies. We also give some examples of normal search strategies with surprisingly small variance, in particular, much smaller than is possible for the class of consistent strategies that are the focus of the work by Lent and Mahmoud.

Citation

Download Citation

Russell Lyons. Kevin Zumbrun. "Normality of tree-growing search strategies." Ann. Appl. Probab. 8 (1) 112 - 130, February 1998. https://doi.org/10.1214/aoap/1027961036

Information

Published: February 1998
First available in Project Euclid: 29 July 2002

zbMATH: 0941.68036
MathSciNet: MR1620342
Digital Object Identifier: 10.1214/aoap/1027961036

Subjects:
Primary: 68P10
Secondary: 60F05

Keywords: insert , limit distribution , Sort

Rights: Copyright © 1998 Institute of Mathematical Statistics

JOURNAL ARTICLE
19 PAGES


SHARE
Vol.8 • No. 1 • February 1998
Back to Top