[trwhite]

> Choosing the dividing element at random is a good strategy to avoid bad worst-case runtime.

Please can someone explain what’s meant by “bad worse-case runtime”?

[Onavo]

Worst case is n^2, where the chosen element is either the largest or the smallest element. Then the result is an insertion sort across the whole list. (Not sure if the order would matters, don't remember off the top of my head).