Call Graphs of Fibonacci-Like Functions

parameters in f(n)=f(n-a)+f(n-b):

a

1

b

2

initial n

10

In a recursively defined function,

f(n)

for a particular

n

is computed by "calling" the function

f

with different arguments

n

. This Demonstration shows the graph of "calls" made, for various Fibonacci-like recursive definitions.