Consider the following recursive function: int Func(int num) { if (num == 0) return 0; else return num+Func(num+1); } 1. Is there a constraint on the values that can be passed as a parameter for this function to pass the smaller-caller question? 2. Is Func(7) a good call? If so, what is returned from the function? 3. Is Func(0) a good call? If so, what is returned from the function? 4. Is Func(-5) a good call? If so, what is returned from the function?
Consider the following recursive function:
int Func(int num)
{
if (num == 0)
return 0;
else
return num+Func(num+1);
}
1. Is there a constraint on the values that can be passed as a parameter for this function to pass
the smaller-caller question?
2. Is Func(7) a good call? If so, what is returned from the function?
3. Is Func(0) a good call? If so, what is returned from the function?
4. Is Func(-5) a good call? If so, what is returned from the function?
1) yes, it needs a constraint on the values that are passed as a parameter of this function to pass smaller-caller fuction.
2) For Func(7)
it will return the value as num+Func(num+1) i.e.
7+(7+1)=15
3) For Func(0)
it will return 0 as
int Func(int num)
{
if (num == 0)
return 0;
4) If func(-5)
it will return the value, as per the function
-5+(-5+1)=-9
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
