Recursion, or "divide-and-conquer", allows us to define a function that calls itself to solve a problem by breaking it into simpler cases.

 

A recursive case calls the recursive procedure on a simpler case (usually a part of the input).

 

A base case is necessary in recursion; it determines when the procedure returns a value (or terminates), rather than continuing the recursive process.