Quiz 2 STL question 3

#1

In the case of recursion here i will go till n then the complexity should be o(n) why O(n^2) is given

#2

Please copy and paste the question here.

#3

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);
}

#4

Yes the answer must be O(n). It must be marked wrong there.There is an issue with quizzes right now that we are trying to fix. Sorry for the inconvenience caused.

#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.