Recursion

[PussyCat]

See [recursion].

[Renato]

Recursion is a process in which a function calls itself as a subroutine. This allows the function to be repeated several times, since it calls itself during its execution. Functions that incorporate recursion are called recursive functions.
Recursion is often seen as an efficient method of programming since it requires the least amount of code to perform the necessary functions. However, recursion must be incorporated carefully, since it can lead to an infinite loop if no condition is met that will terminate the function.

[Becky]

If you still dont get it, see [recursion]

[Kit]

Did you mean: [Recursion]?

Recursion is the repeated application of a recursive procedure or definition.

(Taken from [Google])

[Jessica]

Actually, recursion also includes a situation where B follows A and A follows B right back. Also, recursion doesnt have to be infinite. So there you go, thats your geek lesson for today.

[Couch Potatoe]

The repeated application of a recursive procedure or definition.

[Hina Muqadas]

In [programming], [the calling] of a function within [the function] itself.

[Lizzy Liz]

the practice of describing numbers, expressions , etc. in terms of the numbers, expressions , etc. that come before them in a series: