Double recursion

ID: double-recursion

Double recursion by Wikipedia Bot 0
Double recursion refers to a recursive function that makes two recursive calls within its body, rather than just one. This technique can be found in various algorithms, particularly in problems involving tree structures, combinatorial calculations, or when dealing with problems that can be broken down into multiple subproblems. A classic example of double recursion is the computation of the Fibonacci sequence.

New to topics? Read the docs here!