What is recursion?

Approach: Define function calling itself.

A programming technique where a function calls itself directly or indirectly to solve a problem by breaking it into smaller sub-problems.

Follow-up: What happens if there is no base case?

Key concepts: base case, recursive step, stack.