If, however, quicksort chooses some random element to be the pivot, then an adversary without knowledge of what random numbers are coming up cannot arrange the data to guarantee worst-case execution time for quicksort.
Should quicksort pick any random element as the pivot, an opponent without insight into future random selections cannot guarantee the worst-case performance of quicksort.