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 method calling itself on a smaller version of the problem.

A recursive method invokes itself; it terminates through a base case, and each active call occupies a frame on the call stack.

Loading interactive…

Examples

  • static int Factorial(int n) => n <= 1 ? 1 : n * Factorial(n - 1); calls itself on a smaller n until it reaches 1.

See also

call stack loop
Read the full section →