Getting TLE in cpp implementation
Link to my Code :-
Quick Sort IMplementation in cpp
You have not called shuffle function anywhere in your code. Worst case complexity of normal quick sort algorithm is O(n^2). Try to read about randomized quick sort, and implement it.
Hope this helped 
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.