# Made easy Test Series question....

Consider th following cases for quick sort to sort an array of n element $a[0...n-1]$
For which of the above cases quick sort always gives $O(nlogn)$ time complexity?