(Computers) A programming technique in which a function calls itself as a subfunction. Such calls may be repeated in series to arbitrary depth, provided that a terminating condition is given so that the final (deepest) call will return a value (rather than continue to recurse), which then permits the next higher call to return a value, and so forth, until the original call returns a value to the calling program. –>
Webster 1828 Edition
Recursion
RECUR'SION
,
Noun.
[L. recursus, recurro; re and curro, to run.] Return. [Little used.]