For 10 points, name this programming model, the opposite of iteration, in which a function's definition includes a call to itself.
The runtime of algorithms that employ this paradigm can be found with the Akkra-Bazzi method or the Master theorem, and it can be less efficient than other methods due to the need to store the call stack. It is utilized by divide and conquer algorithms such as binary search, and it can be used to solve the Towers of Hanoi problem or implement the factorial function, which can be defined as "n time n-1 factorial." For 10 points, name this programming model, the opposite of iteration, in which a function's definition includes a call to itself.
The runtime of algorithms that employ this paradigm can be found with the Akkra-Bazzi method or the Master theorem, and it can be less efficient than other methods due to the need to store the call stack.
{recursion} [accept {divide} and {conquer} until it is read]