Kizspy | Question: 28
(Choose 1 answer)
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
FUOVERFL
E. None of the other choices is correct
