is it o(n) or o(n^2)
What is the timecomplexity of this question?
hello @gaganpreetsachdev1
it will be O(n^2).
because we have to touch each elements atleast once for swapping
It isnt satisfying one test case. Please check
increase the size of ur array …
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.