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.
Contributed by:
Stephen Wolfram
X
X
X
X
Show Source Code
|
Download Source Code Notebook
Fibonacci Number
(
Wolfram
MathWorld
)
Generalized Fibonacci Number
(
Wolfram
MathWorld
)
"
Call Graphs of Fibonacci-Like Functions
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/CallGraphsOfFibonacciLikeFunctions/
Contributed by:
Stephen Wolfram
Computer Science
Computer Systems
Computers
Recursion
Call Graphs of Nestedly Recursive Functions
Tree Form of Recursive Function Evaluation Steps
Recursion in the Ackermann Function
Sorting Networks
Conway Sequence with Varying Initial Conditions
Beta Cube
Amdahl's Law
Exploring Unicode Space
De Bruijn Graph Arcs
Plots of Compositions of Bitwise Operations
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
