Q13_97_20250808160621.webp

☑Kizspy.me
Answer (Choose 1 answer)
☐ A
☐ E
Consider the following function:
int fun(int n)
{if (n < 0)
return(fun(-n));
else if(n<5)
return(2);
else
}
return(n*fun(n/2));
Which call will result in the most recursive calls?
A. fun(1014);
B. fun(100);
Back
Next
FUQ.sh
sh the exam.
C. fun(0);
D. fun(1012);
E. fun(-1012);