Computing Fibonacci Sequence
Explore how to recursively compute the Fibonacci sequence using C++ in this lesson. Understand the base and recursive cases, see a practical code implementation, and learn how recursion naturally fits this mathematical pattern. Gain skills that prepare you to solve similar number-based recursion problems effectively.
What is a Fibonacci Sequence?
The Fibonacci sequence is one of the most famous formulas in mathematics. Each number in the sequence is the sum of the two numbers that precede it.
So, the sequence goes:
$ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 … $
Generic Mathematical Notation
Any number, at position n in the series, can be calculated using the following equation:
n n-2n-1
By default, the first and second number in the sequence are 0 and 1
1
2
3 ...