Tag Archives: recursive functions

Fibonacci | Recursively or Not?

You’re probably all aware of the Fibonacci number sequence. Starting with 0 and 1, the next number is determined by the sum of the previous two numbers, so the sequence begins: 0, 1, 1, 2, 3, 5, 8, 13, 21, … This is a mathematical concept, and it is defined by a “recurrence relation” (that’s […]