Title:

Partitioning Schemes for Quicksort and Quickselect

Subtitle:

Raport Badawczy = Research Report ; RB/68/2003

Creator:

Kiwiel, Krzysztof

Publisher:

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

Place of publishing:

Warszawa

Date issued/created:

2003

Description:

21 pages ; 21 cm ; Bibliography p. 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:

Text

Detailed Resource Type:

Report

Source:

RB-2003-68

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