Mathematics and Computer Science 2000
DOI: 10.1007/978-3-0348-8405-1_5
|View full text |Cite
|
Sign up to set email alerts
|

Smoothness and Decay Properties of the Limiting Quicksort Density Function

Abstract: Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f , and that each derivative f (k) enjoys superpolynomial decay at ±∞. In particular, each f (k) is bounded. Our method is sufficiently computational to prove, for example, that f is bounded by 16.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
73
0

Year Published

2001
2001
2018
2018

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 35 publications
(75 citation statements)
references
References 11 publications
2
73
0
Order By: Relevance
“…The proof is almost identical to the proof of the special case in [6], so we will omit some details. For any random variable Z, we abuse notation slightly and denote by SZ the random variable h Z,Z * (U ) = U Z + (1 − U )Z * + g(U ) where U , Z, and Z * are independent, with Z * L = Z and U ∼ unif(0, 1); thus SZ is a random variable with the distribution SL(Z).…”
Section: Bounds On the Characteristic Functionsmentioning
confidence: 92%
See 4 more Smart Citations
“…The proof is almost identical to the proof of the special case in [6], so we will omit some details. For any random variable Z, we abuse notation slightly and denote by SZ the random variable h Z,Z * (U ) = U Z + (1 − U )Z * + g(U ) where U , Z, and Z * are independent, with Z * L = Z and U ∼ unif(0, 1); thus SZ is a random variable with the distribution SL(Z).…”
Section: Bounds On the Characteristic Functionsmentioning
confidence: 92%
“…However, there is no reason to believe that our method yields the best possible bounds, and the best constants for the special case in [6] may be smaller than the best constants in Theorem 2.1 here. ]…”
Section: Bounds On the Characteristic Functionsmentioning
confidence: 98%
See 3 more Smart Citations