Randomization of the pivots produces O(n log n) average running time with a very low probability of any other running time for any value of n where the worst case running time matters.
What changes is that one very common permutation of data (ascending data) does not have O(n * 2) performance.