In computer science, the divide and conquer algorithm solves a problem by forming two problems of half the size and solving each half-problem via this method.
Determining a relation of this type is the first step in finding generating functions, and one non-primitive function of this type is the Ackermann function. In computer science, the divide and conquer algorithm solves a problem by forming two problems of half the size and solving each half-problem via this method. This method can be used to generate the factorial because the factorial is n times the factorial of n-1, and the Fibonacci sequence is also defined as this type of sequence because its terms are found from previous terms in the sequence. For 10 points, identify this method, which defines a function's values based on its previous values.
Determining a relation of this type is the first step in finding generating functions, and one non-primitive function of this type is the Ackermann function.
{recursion} [accept word forms]