PA of Algorithms Q46

0. Consider the following C function:

double foo(int n)
{
int i;
double sum;
if (n = = 0) return 1.0;
else
{
sum = 0.0;
for (i = 0; i < n ; i ++)
sum + = foo(i);
return sum;
}
}
The space complexity of the above function is

Answer
Comment
Array

Option : B
Explanation :
Here foo(1) is recursive function. Spare complexity is O (n) as there can be at most O (n) active function at a time

Forgot your password?

I agree with the Terms.