BibTeX
CSL-JSON
MLA
Harvard
Probabilistic Analysis of the Dual-Pivot Quicksort "Count"
release_dfu32oilsfcrfgbqppr6r3ri4e
by
Ralph Neininger, Jasmin Straub
Released
as a article
.
2017
Abstract
Recently, Aum\"uller and Dietzfelbinger proposed a version of a dual-pivot
quicksort, called "Count", which is optimal among dual-pivot versions with
respect to the average number of key comparisons required. In this note we
provide further probabilistic analysis of "Count". We derive an exact formula
for the average number of swaps needed by "Count" as well as an asymptotic
formula for the variance of the number of swaps and a limit law. Also for the
number of key comparisons the asymptotic variance and a limit law are
identified. We also consider both complexity measures jointly and find their
asymptotic correlation.
In text/plain
format
Archived Files and Locations
application/pdf 374.5 kB
file_zj7b2sbzyvgrvlml7w6sealwsi
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1710.07505v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links