Skip to content

Recursion & Call Stack

Programming

Master recursion, tail call optimization, and converting to iteration.

Official Site
01

Overview

Recursion: function calling itself for smaller subproblems. Each call adds stack frame. Tail recursion can be optimized but JS engines do not implement TCO.

bash
function fact(n){return n<=1?1:n*fact(n-1);}
function fib(n){let[a,b]=[0,1];for(let i=0;i<n;i++)[a,b]=[b,a+b];return a;}
02

Best Practices

Always define base case first. For deep recursion convert to iteration. Memoize overlapping subproblems. Prefer iteration for simple loops.

Ready to try Recursion & Call Stack?

Visit the official site for the latest version and full documentation.

Visit Recursion & Call Stack