Call Graphs of Fibonacci-Like Functions

In a recursively defined function, 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.

 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+