Title:

Randomized Selection Revisited

Subtitle:

Raport Badawczy = Research Report ; RB/79/2002

Creator:

Kiwiel, Krzysztof

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2002

Description:

26 pages ; 21 cm ; Bibliography p. 22-26

Subject and Keywords:

Medians ; Computational complexity ; Partitioning ; Selection ; Selekcja ; Mediany ; Partycjonowanie ; Złożoność obliczeniowa

Abstract:

It is shown that several versions of Floyd and Rivest’s algorithm Select for finding the kth smallest of n elements require at most n+min{k, n-k} + o(n) comparisons on aveage and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. The computational results confirm that Select may be the best algorithm in practice.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2002-79

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open