Abstract
Quicksort may be the most familiar and important randomised algorithm studied in computer science. It is well known that the expected number of comparisons on any input of n distinct keys is Θ(n ln n), and the probability of a large deviation above the expected value is very small. This probability was well estimated some time ago, with an ad-hoc proof: we shall revisit this result in the light of further work on concentration. © 2013 Springer-Verlag.
Cite
CITATION STYLE
McDiarmid, C. (2013). Quicksort and large deviations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7721 LNCS, pp. 43–52). https://doi.org/10.1007/978-3-642-36046-6_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
