Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

recursion

A function calling itself.

Recursion is a function calling itself; each call gets its own stack frame.

Loading interactive…

Examples

  • countdown(2) calls countdown(1), which calls countdown(0): three frames on the stack at once, each with its own n.

See also

stack frame stack overflow stack
Read the full section →