(41
Answer (Choose 1 answer)
Multiple choices 41/50
Next
Consider the following function:
int fun(int n)
{ if (n < 0)
return(fun(-n));
else if(n<5)
return(2);
} return(n*fun(n/2));
else
Which call will result in the most recursive calls?
A. fun(-1012);
B. fun(100);
C. fun(0);
D. fun(1012);
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16 17
18 19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45 46
47
48
49
50
