Metadata language
Partitioning Schemes for Quicksort and Quickselect
Subtitle:Raport Badawczy = Research Report ; RB/68/2003
Creator: Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:21 stron ; 21 cm ; Bibliografia s. 20-21
Subject and Keywords:Sorting ; Quicksort ; Quickselect ; Partitioning ; Selection ; Selekcja ; Partycjonowanie ; Sortowanie
Abstract:The paper introduces several modifications of the partitioning schemes used in Hoareās quick-sort and quickselect algorithms, including ternary schemes which identify keys less or greater than the pivot. Estimates for the numbers of swaps made by each scheme are given. The performed computational experiments indicate that ternary schemes allow quickselect to identify all keys equal to the selected key at little additional cost.
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: