The Euler Project // Episode 2.1 - The Fibonacci Sequence
In this episode, we tackle the second of the Euler problems.
Find the sum of all the even Fibonacci numbers less than four million.
It turns out that this is not a very hard problem to solve. So why are there three episodes? Well, because in this series we take things to the max.
In this episode, we’ll first solve the problem through a simple inspection. Then we’ll write a general-purpose algorithm to solve it. Then we’ll explore that algorithm by asking it to solve much larger problems.
This will lead us on a very interesting journey exploring efficiency in space and in time. Along the way, we’ll learn about recursion, memoization, iteration, and Laziness.
And in the end, we’ll have developed many useful concepts and tools — just in time for Part II.