Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-26T10:12:34.888Z Has data issue: false hasContentIssue false
  • English
  • Français

Quickselect and the Dickman Function

Published online by Cambridge University Press:  06 September 2002

HSIEN-KUEI HWANG  and
TSUNG-HSI TSAI
HSIEN-KUEI HWANG
Affiliation:
Institute of Statistical Science, Academia Sinica, Taipei 115, Taiwan (e-mail: hkhwang@stat.sinica.edu.tw)
TSUNG-HSI TSAI
Affiliation:
Institute of Statistical Science, Academia Sinica, Taipei 115, Taiwan (e-mail: hkhwang@stat.sinica.edu.tw)
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 11 , Issue 4 , July 2002 , pp. 353 - 371
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)