Base case

Definition

In recursive algorithms, the base case represents one or more conditions that determine when to stop further recursive calls. It provides the final result or solution without further recursion.

Related terms

Recursive Step: The part of a recursive algorithm that breaks down the problem into smaller subproblems.

Termination Condition: An alternative term for base case, representing the condition that stops the recursion.

Factorial Function: A common example of a recursive function where the base case is defined as when the input value is 0 or 1.