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; …1 unit
void calcSum(vector v, int i)
{
if(i == v.size())…1unit
return;
sum += v[i];…1unit
calcSum(v, i+1);…??
}
How to find the tc here?
I am unable to see the answers that i answered correctly and incorrectly. Please provide the answers of c++ stl quiz so i can check
The time complexity is O(N) because calcSum is called once for each element in the vector.
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.