Program illustrates computational differences in tree recursive vs iterative methods for generating the Fibonacci sequence. press 'r' for tree-recursive method press 'i' for iterative method press 'd' to draw the Fibonacci spiral using iterative method press 'p' to plot the Pegg 2003 binary numbers triangle referenced on mathworld.wolfram.com/FibonacciNumber.html press the button in plot mode to mute the sound effect and rest for 1 and 0 Scaling below 4 gives the impression that the lower right corner is entirely zeros, this is just the method reaching its limit. I think the numbers just get too big to convert from integer to binary the way I did it.
The Fibonacci sequence is 0, 1, 1, 2, 3, 5, 8, 13... The sum of n-1 and n-2 is equal to n for term n. Program is inspired by Structure and Interpretation of Computer Programs Example 1.2.2 as well as http://mathworld.wolfram.com/FibonacciNumber.html article reference to Pegg 2003 plot of the first 511 fibonacci numbers in binary and the triangles that appear as pattern within. KCynide's video helped me with my integer-to-binary conversion: https://www.youtube.com/watch?v=c4-sfyTX2v4
