Recursion

Also written: recursive

A technique where a function calls itself on a smaller version of the problem until it reaches a base case that it can answer directly. It suits trees, backtracking and dynamic programming, but very deep recursion can overflow the call stack.