Partitioning schemes for quicksort and quickselect

Simple item page
dc.creatorKiwiel, Krzysztof C.
dc.date2003-12-23
dc.date.accessioned2026-07-07T03:20:47Z
dc.date.available2026-07-07T03:20:47Z
dc.descriptionWe introduce several modifications of the partitioning schemes used in Hoare's quicksort and quickselect algorithms, including ternary schemes which identify keys less or greater than the pivot. We give estimates for the numbers of swaps made by each scheme. Our computational experiments indicate that ternary schemes allow quickselect to identify all keys equal to the selected key at little additional cost.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/cs/0312054
dc.identifierhttp://arxiv.org/abs/cs/0312054
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31949
dc.subjectData Structures and Algorithms
dc.subjectF.2.2; G3
dc.titlePartitioning schemes for quicksort and quickselect
dc.typetext

Files

Collections

arXiv