The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,….. Which technique can be used to get the n
Posted: Wed Jul 13, 2022 7:40 pm
a) Recursion
b) Dynamic programming
c) A single for loop
d) Recursion, Dynamic Programming, For loops
b) Dynamic programming
c) A single for loop
d) Recursion, Dynamic Programming, For loops