What is a base case in a recursive function?
A base case is the condition that allows the algorithm to stop recursing. It is usually a problem that is small enough to solve directly.
The base case is summary of the overall problem that needs to be solved.
The base case is similar to a base class, in that it can be inherited by another object.
The base case is passed in as an argument to a function whose body makes use of recursion.