This technique is employed by the fastest algorithms for computing factorials, and its "tail-" form can emulate iterative processes.
The Ackermann function must be expressed using this concept, and it is often used to define fractals such as the Sierpinski triangle. This technique is employed by the fastest algorithms for computing factorials, and its "tail-" form can emulate iterative processes. The operation of an algorithm of this kind continues until encountering a base case. For 10 points, name this technique from computer science employed by functions which call themselves.
The Ackermann function must be expressed using this concept, and it is often used to define fractals such as the Sierpinski triangle.
{recursion} [accept word forms such as {recursive}]