Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort (Extended Abstract) - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2010

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

Résumé

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$.
Fichier principal
Vignette du fichier
dmAM0116.pdf (357.17 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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, ⟨10.46298/dmtcs.2800⟩. ⟨hal-01185599⟩

Collections

TDS-MACS
54 Consultations
501 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More