In tc 0 I am getting TLE. Why ?
Why i m getting TLE in one test case?
Hey Naman, time complexity of your sorting algorithm in O(n^2) which won’t work for large value of n. You can either use stl sort or merge sort having complexity O(nlogn).
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.