Recursive Function

Definition

A recursive function is a function that calls itself within its own code, either directly or indirectly.

Related terms

Base Case: In a recursive function, the base case is the condition that determines when to stop recurring and return a value instead.

Recursive Call: The act of calling the same function within its own code.

Stack Overflow: An error that occurs when there are too many nested recursive calls and the call stack exceeds its limit, causing program termination.