The base case is the simplest version of the problem, so simple that you can answer it directly without recursion. It is your exit condition.
For example, when computing factorial, the base case is . Without a base case, recursion never stops and the program crashes with a stack overflow. Every recursive function must check for the base case first before making any recursive calls. But the base case alone is not enough. You also need a way to get there.
