Question: Consider the following recursive function written in C that computes 1 + 2 + 3 + n int sum(int n){ int y ; if (n
Consider the following recursive function written in C that computes
1 + 2 + 3 + n
int sum(int n){
int y ;
if (n <= 1)
return 1;
else
y = n + sum(n-1);
return y;
}
Describe the changes of frames on stack after a function call of sum(3)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
