Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Raport Badawczy = Research Report ; RB/68/2003
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
21 pages ; 21 cm ; Bibliography p. 20-21
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.
Raport Badawczy = Research Report
Creative Commons Attribution BY 4.0 license
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: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
Oct 19, 2021
Sep 17, 2020
56
https://rcin.org.pl./publication/174943
Edition name | Date |
---|---|
RB-2003-68 : Kiwiel Krzysztof Czesław : Partitioning Schemes for Quicksort and Quickselect | Oct 19, 2021 |