
13.3 Recursion with Two Base Cases 957
13.3 Recursion with Two Base Cases
Recursive formulations can be more complex than the examples we have
discussed. The general case can involve more than one recursive call, with
different arguments. This, in turn, means that we can have more than one
base case.
Suppose we are playing a networked video game online. There are n players
who would like to play. Unfortunately, that game can be played with only p
players. We will make the assumption that p is an integer between 0 and n
(for instance, n could be 100 and p could be 8). Otherwise, we simply can-
not play the game.
Our problem is to determine how many different ...