Re-cur′sion
(-sh?n)
,
[L.
recursio
. See
Recur
.]
The act of recurring; return.
[Obs.]
(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. –>