This concept is also used by the relation that defines the Fibonacci sequence and by the factorial function.
If a call is the "tail" variety of this, a functional language will not add that call to the stack. Memoization provides a faster alternative to this concept, which is exponentially slow in the case of computing the Fibonacci numbers. This idea is the basis for divide-and-conquer algorithms, which break a problem down into smaller sub-problems until either a stack overflow occurs or a base-case problem is reached. This concept is also used by the relation that defines the Fibonacci sequence and by the factorial function. For 10 points, identify this concept in computing, wherein a function references itself.
If a call is the "tail" variety of this, a functional language will not add that call to the stack.
recursion [accept word forms; do not accept “INCEPTION”] &lt;SS&gt;