Randomized quick sort

#1

How can we say that the randomised generated array will
give average case complexity of o(nlogn) ??

#2

Quick sort has complexity nlogn.
Worst is n^2.
To avoid this worst case, we shuffle elements and say that now we will get nlogn.