Recursion termination

In computing, recursion termination is when certain conditions are met and a recursive algorithm stops calling itself and begins to return values. This happens only if, with every recursive call, the recursive algorithm changes its state and moves toward the base case. Cases that satisfy the definition, without being defined in terms of that definition, are called base cases. They are small enough to solve directly.