Quickselect and the Dickman function
HK Hwang, TH Tsai - Combinatorics, Probability and Computing, 2002 - cambridge.org
HK Hwang, TH Tsai
Combinatorics, Probability and Computing, 2002•cambridge.orgWe 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.
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.
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.
Cambridge University Press以上显示的是最相近的搜索结果。 查看全部搜索结果