Partial Quicksort and Quickpartitionsort - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

Partial Quicksort and Quickpartitionsort

Abstract

Partial Quicksort sorts the $l$ smallest elements in a list of length $n$. We provide a complete running time analysis for this combination of Find and Quicksort. Further we give some optimal adapted versions, called Partition Quicksort, with an asymptotic running time $c_1l\ln l+c_2l+n+o(n)$. The constant $c_1$ can be as small as the information theoretic lower bound $\log_2 e$.
Fichier principal
Vignette du fichier
dmAM0135.pdf (236.99 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01185579 , version 1 (20-08-2015)

Identifiers

Cite

Conrado Martínez, Uwe Rösler. Partial Quicksort and Quickpartitionsort. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.505-512, ⟨10.46298/dmtcs.2781⟩. ⟨hal-01185579⟩

Collections

INSMI TDS-MACS
159 View
1218 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More