How can it be O(N^2)?
@we_kaash vector v is passed as a copy, not a reference. So for each function call, a copy of the vector is made. Making a copy takes O(n) time and if the operation is done n times, the overall complexity becomes O(n*n).
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.