Tree Form of Recursive Function Evaluation Steps

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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 .



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send