Multiple choices 23/50
Answer (Choose 1 answer)
Next
Given the recursive algorithm that computes the n-th Fibonacci number
Procedure F(n: natural number)
If n = 0 then F(n): = 0
else If n = 1 then F(n): = 1 else F(n):= F(n-1) + F(n-2);
How many additions are used if n = 6?
A. 8
B. 7
C. 9
D. 12
E. None of the other choices is correct
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
