Author:
HWANG HSIEN-KUEI,TSAI TSUNG-HSI
Abstract
We show that the limiting distribution of the number of comparisons used by Hoare's
quickselect algorithm when given a random permutation of n elements for finding the
mth-smallest element, where m = o(n), is the Dickman function. The limiting distribution
of the number of exchanges is also derived.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献