Q300
The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, .... Which technique can be used to get the nth fibonacci term?
A.
Recursion
B.
Dynamic programming
C.
A single for loop
D.
Recursion, Dynamic Programming, For loops
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board