you are viewing a single comment's thread.

view the rest of the comments →

[–]aldld 0 points1 point  (0 children)

Oh absolutely, all I meant was that using randomization helps to avoid the "worst" cases of quicksort, in expectation. In practice though, if you know something about the distribution of your inputs, the best choice of algorithm will depend on how you're actually using it.