A numerical analysis of Quicksort: How many cases are bad cases?

Guido Hartmann

We present numerical results for the probability of bad cases for Quicksort, i.e. cases of input data for which the sorting cost considerably exceeds that of the average. Dynamic p…