The following sequence is a fibonacci sequence:0, 1, 1, 2, 3, 5, 8, 13, 21, ..

Question

TuteeHUB · Accepted Answer

Recursion, Dynamic Programming, For loops

TuteeHUB · Answer

nWhich technique can be used to get the nth fibonacci term?

TuteeHUB · Answer

Recursion

TuteeHUB · Answer

Dynamic programming

TuteeHUB · Answer

A single for loop

TuteeHUB · Answer

Recursion, Dynamic Programming, For loops

1.	The following sequence is a fibonacci sequence:0, 1, 1, 2, 3, 5, 8, 13, 21, ..
A.	nWhich technique can be used to get the nth fibonacci term?
B.	Recursion
C.	Dynamic programming
D.	A single for loop
E.	Recursion, Dynamic Programming, For loops
Answer» E. Recursion, Dynamic Programming, For loops

Discussion