Randomised partition vs Lomuto Partition in Quick Select

How does Randomised partition improve the performance of the Quick Select Algorithm, even though the worst-case time complexity of both the algorithms (using Lomuto and randomized partition) is O(n^2)?