Functions that commonly use this method include the divide-and-conquer solution to Towers of Hanoi and mergesort.
This type of method can be optimized by reusing the stack frame of the previous function call; that is known as tail optimization. Functions that commonly use this method include the divide-and-conquer solution to Towers of Hanoi and mergesort. A function that uses this procedure without a (*) base case will run forever. Commonly used in binary tree traversals, for 10 points, name this method where a function references itself in its definition.
This type of method can be optimized by reusing the stack frame of the previous function call; that is known as tail optimization.
{recursion} [or {recursive} functions]