Tree Form of Recursive Function Evaluation Steps

Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
This shows the step-by-step process of the evaluation of a recursive function as a tree. The function is defined by . Typically the evaluation requires many steps, beginning with huge, deeply nested expressions, then changing to an overall decrease in size (with some fluctuations), until the recursive function gets its final value.
Contributed by: Enrique Zeleny (March 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
This Demonstration shows intermediate expressions arising while evaluating , where
is defined by recurrence relation
and initial conditions
.
Permanent Citation