K. L. Chung, A Course in Probability Theory, 2001.

J. A. Fill and S. Janson, Quicksort asymptotics, Journal of Algorithms, vol.44, issue.1, pp.4-28, 2002.
DOI : 10.1016/S0196-6774(02)00216-X

J. A. Fill and S. Janson, The number of bit comparisons used by Quicksort: an average-case analysis, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.300-307, 2004.
DOI : 10.1214/EJP.v17-1812

A. M. Fink, M. Jodeit, and J. , On Chebyshev's other inequality, Inequalities in statistics and probability, pp.115-120, 1982.
DOI : 10.1214/lnms/1215465637

C. A. Hoare, Quicksort, The Computer Journal, vol.5, issue.1, pp.10-15, 1962.
DOI : 10.1093/comjnl/5.1.10