Randomized quicksort and the entropy of the random source

Authors:
Beatrice List;Markus Maucher;Uwe Schöning;Rainer Schuler
Affiliations:
Abt. Theoretische Informatik, Universität Ulm, Ulm, Germany;Abt. Theoretische Informatik, Universität Ulm, Ulm, Germany;Abt. Theoretische Informatik, Universität Ulm, Ulm, Germany;Abt. Theoretische Informatik, Universität Ulm, Ulm, Germany
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 3
Cited 1

Randomized algorithms and pseudorandom numbers

Journal of the ACM (JACM)
Pseudorandomness and Cryptographic Applications

Pseudorandomness and Cryptographic Applications
Generating Quasi-Random Sequences From Slightly-Random Sources

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Towards understanding algorithmic factors affecting energy consumption: switching complexity, randomness, and preliminary experiments

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The worst-case complexity of an implementation of Quicksort depends on the random source that is used to select the pivot elements. In this paper we estimate the expected number of comparisons of Quicksort as a function of the entropy of the random source. We give upper and lower bounds and show that the expected number of comparisons increases from nlog 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, as well as an upper bound when using a δ-random source.