Base cases

Definition

Base cases are the conditions in a recursive algorithm that determine when the recursion should stop. They are the simplest cases of the problem that can be solved directly without further recursion.

Related terms

Recursive step: The part of a recursive algorithm where the problem is broken down into smaller, similar subproblems.

Recursion:

A process where a function calls itself within its own definition.

Termination condition: A condition that determines when a loop or recursive function should stop executing.