☑Kizspy.me
(Choose 1 answer)
☐ A
Suppose the h(n) function is defined on the set of integer numbers as below.
For the call h(3), how many calls to h will be made, including the original call?
int h(int n)
{if (n == 0 || n==1)
return(1);
else
return(h(n-1)+h(n-2));
}
A. 2
B. 3
C. 4
Back
Next
D. 5
FUO.sh
sh the exam.
