Quicksort Algorithm Again Revisited

  title={Quicksort Algorithm Again Revisited},
  author={Charles Knessl and Wojciech Szpankowski},
  journal={Discrete Mathematics & Theoretical Computer Science},
We consider the standard Quicksort algorithm that sorts n di tinct keys with all possible n! orderings of keys being equally likely. Equivalently, we analyze the total path length Ln in a randomly builtbinary search tree . Obtaining the limiting distribution ofLn is still an outstanding open problem. In this paper, we estab li h an integral equation for the probability density of the number of comparisons Ln. Then, we investigate the large deviations of Ln. We shall show that the left tail of… CONTINUE READING

From This Paper

Topics from this paper.
29 Citations
16 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 16 references

Random Search Trees

  • H. Mahmoud, Evolution
  • 1992
Highly Influential
4 Excerpts

Some Properties of a Limitin g Distribution in Quicksort,Statistics

  • K. H. Tan, P. Hadjicostas
  • Probability Letters,
  • 1995
1 Excerpt

Probability Metrics and Recursive Algorithms

  • L. Rüschendorf
  • Adv . Appl . Prob .
  • 1992

Partition Asymptotics from R ecursions,SIAM

  • C. Knessl, J. B. Keller
  • J. Appl. Math. ,
  • 1990
2 Excerpts

Similar Papers

Loading similar papers…