Tree Form of Recursive Function Evaluation Steps

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.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


This Demonstration shows intermediate expressions arising while evaluating , where is defined by recurrence relation and initial conditions .
    • 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 »

Files require Wolfram CDF Player or Mathematica.