The Worst Case Permutation for Median-of-Three Quicksort
Hannu Erkiö · The Computer Journal · 1984
An algorithm is given which forms the worst case permutation for one of the most efficient versions of quicksort (median-of-three quicksort). This makes the experimental evaluation of this important algorithm possible. The paper includes a simple experimental comparison of the median-of-three and original versions of quicksort.