Rates of convergence for Quicksort

Authors:
Ralph Neininger;Ludger Rüschendorf
Affiliations:
McGill University, School of Computer Science, 3480 University Street, Montreal, PQ H3A 2K6, Canada;Universität Freiburg, Institut für Mathematische Stochastik, Eckerstr. 1, 79104 Freiburg, Germany
Venue:
Journal of Algorithms - Analysis of algorithms
Year:
2002

Citing 1
Cited 2

Quicksort asymptotics

Journal of Algorithms - Analysis of algorithms

Quicksort asymptotics

Journal of Algorithms - Analysis of algorithms
The number of bit comparisons used by Quicksort: an average-case analysis

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of convergence to be of the order Θ (ln(n)/n) in the Zolotarev metric. This implies several ln(n)/n estimates for other distances and local approximation results as for characteristic functions, for density approximation, and for the integrated distance of the distribution functions.