What is the worst-case running time of the Randomized Quicksort algorithm?

O(n^2)

Even with a random pivot, the worst-case scenario (extremely unbalanced partitions) still exists. However, the probability of encountering this case is infinitesimally small for large n, giving it a robust O(n log n) expected time.