Metadata language
Randomized Selection with Tripartitioning
Subtitle:Raport Badawczy = Research Report ; RB/80/2002
Creator: Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:20 stron ; 21 cm ; Bibliografia s. 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: Detailed Resource Type: Source: Language: Language of abstract: Rights:Licencja Creative Commons Uznanie autorstwa 4.0
Terms of use:Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Digitizing institution:Instytut Badań Systemowych Polskiej Akademii Nauk
Original in:Biblioteka Instytutu Badań Systemowych PAN
Projects co-financed by: Access: