Recursion

Recursion is a programming technique where a function or algorithm solves a problem by calling itself as a subroutine, breaking down a larger problem into smaller, self-similar instances until a simple "base case" is reached. The base case is a condition where the problem can be solved directly without further recursion, providing a stopping point to prevent infinite loops. Each recursive call works on a smaller version of the original problem, and the results from these smaller problems are combined to form the solution to the larger one.