Skip to main content
SpringerLink
Log in

On the Probablistic Worst-Case Time of ``Find''

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

We analyze the worst-case number of comparisons T n of Hoare's selection algorithm FIND when the input is a random permutation, and worst case is measured with respect to the rank k . We give a new short proof that T n /n tends to a limit distribution, and provide new bounds for the limiting distribution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, 3480 University Street, Montreal, Quebec, Canada H3A 2K6. luc@cs.mcgill.ca., CA

    L. Devroye

Authors
  1. L. Devroye
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received October 27, 2000; revised November 15, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Devroye, L. On the Probablistic Worst-Case Time of ``Find''. Algorithmica 31, 291–303 (2001). https://doi.org/10.1007/s00453-001-0046-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-001-0046-2

Search

Navigation