Recursion

Definition

Recursion is a programming technique where a function calls itself to solve a problem by breaking it down into smaller, similar subproblems.

Related terms

Base Case: The base case in recursion is the condition that stops the recursive calls and provides an answer or solution directly without further recursion.

Recursive Call:

A recursive call refers to when a function invokes itself during its execution to solve a smaller version of the original problem.

Stack Overflow: A stack overflow occurs when there are too many recursive function calls, causing the program's call stack memory to be exhausted.