April 2018
Beginner to intermediate
426 pages
10h 19m
English
The Fibonacci sequence is another problem that we can solve using recursion. It is a series of the numbers 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on. The number 2 is found by adding 1 + 1. The number 3 is found by adding 1 + 2, 5 is found by adding 2 + 3, and so on! The Fibonacci sequence can be defined as follows: