Sciweavers

COCOON
2005
Springer

Randomized Quicksort and the Entropy of the Random Source

13 years 9 months ago
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 n2 , 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. Keywords. QuickSort, Randomized Algorithms, Entropy.
Beatrice List, Markus Maucher, Uwe Schöning,
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where COCOON
Authors Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
Comments (0)