Author:
KIRSCHENHOFER PETER,PRODINGER HELMUT
Abstract
We study the number of comparisons in Hoare's
Find algorithm. Using trivariate generating
functions, we get an explicit expression for the variance of
the number of comparisons, if
we search for the jth element in a random permutation
of n elements. The variance is also
asymptotically evaluated under the assumption that j
is proportional to n. Similar results
for the number of passes (recursive calls) are given, too.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献