Under the substitution model, processes of this type build a chain of deferred operations.
Under the substitution model, processes of this type build a chain of deferred operations. Languages like Ada, Pascal, and C require an unbounded amount of memory to realize these procedures, necessitating use of "looping constructs" like "for" and "while". The IEEE Scheme standard requires the "tail-" form of this property, so procedures like Euclid's algorithm will never exhaust the stack space. For ten points, identify this class of procedures exemplified by the natural solution to Towers of Hanoi and by Merge sort, which contrasts with iterative and in which a function is defined in terms of itself.
Under the substitution model, processes of this type build a chain of deferred operations.
{Recursive}