Understanding multiple recursion

Multiple recursion is when a recursive function calls itself multiple times during its execution. Unlike simple recursion, where the problem space is reduced linearly with every recursive call, multiple recursion branches out into more than one subproblem during the execution of a single function call. The results from some or all of these branches must be considered when calculating the outcome for each step.