Inny tytuł:

Raport Badawczy = Research Report ; RB/68/2003

Wydawca:

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

Miejsce wydania:

Warszawa

Opis:

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

Abstrakt:

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.

Czasopismo/Seria/cykl:

Raport Badawczy = Research Report

Szczegółowy typ zasobu:

Report

Identyfikator zasobu:

oai:rcin.org.pl:139511

Źródło:

RB-2003-68

Język:

eng

Język streszczenia:

eng

Prawa:

Creative Commons Attribution BY 4.0 license

Zasady wykorzystania:

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: ; -

Digitalizacja:

Systems Research Institute of the Polish Academy of Sciences

Lokalizacja oryginału:

Library of Systems Research Institute PAS

Dofinansowane ze środków:

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.

Dostęp:

Open