License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04421.5
URN: urn:nbn:de:0030-drops-1043
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/104/
|
Go to the corresponding Portal |
List, Beatrice ;
Maucher, Markus ;
Schöning, Uwe ;
Schuler, Rainer
Randomized QuickSort and the Entropy of the Random Source
Abstract
The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate the expected number of comparisons of Quicksort as a function in the entropy of the random source. We give upper and lower bounds and show that the expected number of comparisons increases from $n\log n$ to $n^2$, if the entropy of the random source is bounded. As examples we show explicit bounds for distributions with bounded min-entropy and the geometrical distribution.
BibTeX - Entry
@InProceedings{list_et_al:DagSemProc.04421.5,
author = {List, Beatrice and Maucher, Markus and Sch\"{o}ning, Uwe and Schuler, Rainer},
title = {{Randomized QuickSort and the Entropy of the Random Source}},
booktitle = {Algebraic Methods in Computational Complexity},
pages = {1--15},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {4421},
editor = {Harry Buhrman and Lance Fortnow and Thomas Thierauf},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2005/104},
URN = {urn:nbn:de:0030-drops-1043},
doi = {10.4230/DagSemProc.04421.5},
annote = {Keywords: Randomized Algorithms , QuickSort , Entropy}
}
|
Keywords: |
|
Randomized Algorithms , QuickSort , Entropy |
|
Collection: |
|
04421 - Algebraic Methods in Computational Complexity |
|
Issue Date: |
|
2005 |
|
Date of publication: |
|
24.03.2005 |
