How is the time complexity o ( n ^ 2 )?

#1

Predict the time complexity of the following recursive function, given the vector is of size N and the initial call is calSum(v, 0).

int sum = 0;
void calcSum(vector v, int i)
{
if(i == v.size())
return;
sum += v[i];
calcSum(v, i+1);
}

#2

hi @deepak_four vector is being passed by value, so a new copy of vector is being made for each call. To copy a vector of size n, O(n) time is required. If the call is made n times, the total time complexity will become O(n^2)

#3

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.