Title:

Randomized Selection with Tripartitioning

Subtitle:

Raport Badawczy = Research Report ; RB/80/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:

20 pages ; 21 cm ; Bibliography p. 19-20

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, even when equal elements occur. This parallels recent analysis of another variant due to Floyd and Rivest.The computational results suggest that both variants perform well in practice, and may compete with other selection methods, such as Hoare’s Find or quickselect with median-of-three partitioning.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2002-80

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