Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

JAL
2002

favoriteEmaildiscussreport

69views more JAL 2002»

Rates of convergence for Quicksort

13 years 4 months ago

Rates of convergence for Quicksort

Download www.math.uni-frankfurt.de

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. AMS subject classifications. Primary: 60F05, 68Q25; secondary: 68P10. Key words. Quicksort, analysis of algorithms, rate of convergence, Zolotarev metric, local approximation, contraction method.

Ralph Neininger, Ludger Rüschendorf

Real-time Traffic

JAL 2002 | Local Approximation | Normalized Number | Quicksort Algorithm |

claim paper

Related Content

» Convergence and convergence rate of stochastic gradient search in the case of multiple and...

» Distributional convergence for the number of symbol comparisons used by QuickSort

» Convergence rates of consensus algorithms in stochastic networks

» Sharpness in rates of convergence for the symmetric Lanczos method

» Consensus with constrained convergence rate Agreement in communities

» A Rational Interpolation Scheme with Superpolynomial Rate of Convergence

» The Rate of Convergence of AdaBoost

» QuasiOptimal Convergence Rate of an Adaptive Discontinuous Galerkin Method

» Convergence Rates for Greedy Algorithms in Reduced Basis Methods

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JAL
Authors	Ralph Neininger, Ludger Rüschendorf

Comments (0)