Viewing a single comment thread. View all comments

RecalcitrantHuman t1_j5r03ky wrote

Reply to comment by gotbetterbro in My friend claims that understanding a Fibonacci sequence is hard, but I disagree. by porichoygupto

Are we just gonna gloss over how we get from 0 to 1?

4

RevolutionaryRough37 t1_j5r5ybb wrote

They're the base cases of the recursion and are therefore 0 and 1 by definition. You need two base cases because the recursive function uses the previous two numbers in the series to calculate the current one.

Edit: Sorry calling them base cases is inaccurate since that's another thing entirely in recursion. The reason they're defined stands though, the recurrence requires two initial values to work.

11

DieFlavourMouse t1_j5s0mlz wrote

>Are we just gonna gloss over how we get from 0 to 1?

In the beginning there was nothing...

7