26 seconds | Name binding, Recursion, Iteration, and Continuations - slide 20 : 42 |

Recursion versus iteration

Recursive functions are - modulo use of memory resources - sufficient for any iterative need

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.