Q. 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?

• Recursion
• Dynamic programming
• A single for loop
• Recursion, Dynamic Programming, For loops

Submit