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$.
Type de document :
Communication dans un congrès
Drmota, Michael and Gittenberger, Bernhard. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), pp.219-232, 2010, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01185599
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 20 août 2015 - 16:33:57
Dernière modification le : mardi 7 mars 2017 - 15:08:13
Document(s) archivé(s) le : mercredi 26 avril 2017 - 10:09:36

Fichier

dmAM0116.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01185599, version 1

Collections

Citation

James Allen Fill. Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort (Extended Abstract). Drmota, Michael and Gittenberger, Bernhard. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), pp.219-232, 2010, DMTCS Proceedings. 〈hal-01185599〉

Partager

Métriques

Consultations de la notice

70

Téléchargements de fichiers

124