Skip to Main content Skip to Navigation
Conference papers

Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort (Extended Abstract)

Abstract : Most previous studies of the sorting algorithm $\mathtt{QuickSort}$ have used the number of key comparisons as a measure of the cost of executing the algorithm. Here we suppose that the $n$ independent and identically distributed (iid) keys are each represented as a sequence of symbols from a probabilistic source and that $\mathtt{QuickSort}$ operates on individual symbols, and we measure the execution cost as the number of symbol comparisons. Assuming only a mild "tameness'' condition on the source, we show that there is a limiting distribution for the number of symbol comparisons after normalization: first centering by the mean and then dividing by $n$. Additionally, under a condition that grows more restrictive as $p$ increases, we have convergence of moments of orders $p$ and smaller. In particular, we have convergence in distribution and convergence of moments of every order whenever the source is memoryless, i.e., whenever each key is generated as an infinite string of iid symbols. This is somewhat surprising: Even for the classical model that each key is an iid string of unbiased ("fair'') bits, the mean exhibits periodic fluctuations of order $n$.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01185599
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 20, 2015 - 4:33:57 PM
Last modification on : Monday, January 27, 2020 - 11:06:02 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 10:09:36 AM

File

dmAM0116.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01185599, version 1

Collections

Citation

James Allen Fill. Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort (Extended Abstract). 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.219-232. ⟨hal-01185599⟩

Share

Metrics

Record views

90

Files downloads

591