Call Graphs of Fibonacci-Like Functions
Call Graphs of Fibonacci-Like Functions
In a recursively defined function, for a particular is computed by "calling" the function with different arguments . This Demonstration shows the graph of "calls" made, for various Fibonacci-like recursive definitions.
f(n)
n
f
n