...

/

Inefficient Recursion: Fibonacci Numbers

Inefficient Recursion: Fibonacci Numbers

Let’s study a scenario where recursion introduces inefficiency by repeatedly calculating the same value.

We'll cover the following...

Inefficient recursion

Here is another classic example of recursion – calculating the nthn^{th} Fibonacci number. It turns out that this is hopelessly inefficient using pure recursion, but we will also look at a useful technique to alleviate the problem.

If you are not familiar with the Fibonacci series, it is an infinite series of numbers defined as follows:

F0F_0 = 0
F1F_1 = 1
F2F_2 = F1 ...

Access this course and 1400+ top-rated courses and projects.