11408
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
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.
Contributed by:
Stephen Wolfram
THINGS TO TRY
Automatic Animation
SNAPSHOTS
RELATED LINKS
Fibonacci Number
(
Wolfram
MathWorld
)
Generalized Fibonacci Number
(
Wolfram
MathWorld
)
PERMANENT CITATION
Stephen Wolfram
"
Call Graphs of Fibonacci-Like Functions
"
http://demonstrations.wolfram.com/CallGraphsOfFibonacciLikeFunctions/
Wolfram Demonstrations Project
Published: April 27, 2007
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Call Graphs of Nestedly Recursive Functions
Stephen Wolfram
Tree Form of Recursive Function Evaluation Steps
Enrique Zeleny
Recursion in the Ackermann Function
Stephen Wolfram
Sorting Networks
Stephen Wolfram
Conway Sequence with Varying Initial Conditions
Enrique Zeleny
Beta Cube
Roger Bagula
The Function Computed by the Wolfram 2,3 Turing Machine
Jesse Nochella
Allocation of Bandwidth by TCP
Damon Wischik (UCL)
Bubble Sort Algorithm
Enrique Zeleny
Amdahl's Law
Joel F. Klein
Related Topics
Computer Science
Computer Systems
Computers
Recursion
High School Computer Science
High School Finite Mathematics
High School Mathematics
Browse all topics
Related Curriculum Standards
US Common Core State Standards, Mathematics
HSF-BF.A.1
HSF-BF.A.2
HSF-IF.A.3
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+