Recursion: Difference between revisions

Revision as of 08:09, 19 June 2002

Revision as of 19:03, 28 July 2002

Line 50:

A common method of simplification is to divide the problem into subproblems. Such a programming technique is called ''divide-et-impera'' or ''divide and conquer'' and is a fundamental part of [[dynamic programming]].

Virtually all [[programming language|programming languages]] in use today allow the direct specification of recursive functions and procedures. When such a function is called, the computer keeps track of the various instances of the function by using a [[stack]]. Conversely, every recursive programfunction can be transformed into an interativeiterative programfunction by using a stack.

Any function that can be evaluated by a computer can be expressed in terms of recursive functions, without use of [[iteration]].