How is the time complexity O(N^2)?

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())
sum += v[i];
calcSum(v, i+1);

hi @ashutoshkabra3293
Kindly share the screenshot of the ques…

hi @ashutoshkabra3293
shall I consider ur doubt as resolved as I haven’t heard from u for a long time…

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.