The Fibonacci series Recursion using F(n) = F(n-1) + F(n-2) Will of exponential complexity. This occurs because each of the Term is calculated twice eg F5= F4+F3 F4= F3+F2.
So F3 calculation is done twice. Can someone come up with an algorithm to minimize these computation and come up with efficent algorithm. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
