Computer Science, asked by dikshasingh44669, 8 months ago

Compare Iterative and Recursive algorithm to find out Fibonacci series​

Answers

Answered by mehakbhatia45
1

❗ ANSWER ❗

Further calls of fib(x) for known values may be replaced by a simple lookup, eliminating the need for further recursive calls. This is the main difference between the iterative and recursive approaches, if you are interested, there are also other, more efficient algorithms of calculating fibonacci numbers.

Hope it's helpful dear...........

❌ Itz Mahi Here ❌

Answered by gittu21
0

I hope the answer given by mehak is help ful otherwise I will give the answer!!!!!

Similar questions