Can quick sort time complexity be $\Theta(n\sqrt n)$ for some inputs?
Assume the array is sorted. If you always pick the element at n/2 as pivot then the time is O(n log n). If you always pick the first or last element it’s $O(n^2)$. 

So which pivot gives you $O(n^{1.5})$?