Although recursive Fibonacci is elegant in its design, there is a less beautiful but much faster version that uses a loop to run in linear time.

Question

Quizplus · Accepted Answer

The iterative version of the Fibonacci algorithm runs in linear time, meaning it is much faster than the recursive version which has exponential time complexity. While it may not be as elegant in design, it is more efficient in terms of time and space complexity.

Although Recursive Fibonacci Is Elegant in Its Design, There Is