Quick sort problem

#1


one test case is wrong

#2

@Learning_bunny
i see that ur code is correct but since the i/p file is long and in the worst case quick sort takes o(n^2) time so the test case shows TLE
hence try implementing in O( n logn ) use merge sort or something

#3

use merge sort??? this question is of quick sort and it is not showing tle to me it is just showing wrong answer

#4

when i submit ur code
i get tle for the test case 0
that is why i recommended to implement a better sort( ik its quick sort ) but this being said its worst time complexity is o ( n^ 2)

#5

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.