| | 41 seconds | Name binding, Recursion, Iteration, and Continuations - slide 20 : 42 |
Tail recursive functions in Scheme are memory efficient for programming of any iterative process
Tail recursion is a variant of recursion in which the recursive call takes place without contextual, surrounding calculations in the recursive function.
 | A recursive formulation of the function fak and the accompanying recursive process |
| A tail recursive formulation of the function fak and the accompanying iterative process without memory optimization |
| A tail recursive formulation of the function fak and the accompanying, memory optimized iterative process |