Recursion facts for kids
Recursion is a word from mathematics and computer science. It is used to define a thing, such as a function or a set. A recursive definition uses the thing it is defining as part of the definition.
Contents
Description
Usually, a recursive function refers to itself in some cases (or inputs), but not in every case. A function that referred to itself in every case would never terminate.
When a function refers to itself, it often uses a smaller input than the input it was given. In this way, it can solve a problem by first solving a simpler version of the problem.
Example
An example of a recursive function is:
 If then return .
 If then return .
This function computes the factorial of a natural number. It works because and .
The definition has two cases: a recursive case for , and a case for that is not recursive. The case that is not recursive is called a "base case".
Uses
Recursion can be used to write computer programs. A program that uses recursion may be easier to write and understand than a program that does the same thing without recursion.
Recursion is used in mathematics to prove theorems. This method is called induction.
The idea of recursion can be seen in art and language. For example:
 A fractal image contains smaller versions of itself.
 In the rules of grammar, a sentence can be part of another sentence.
Images for kids

A visual form of recursion known as the Droste effect. The woman in this image holds an object that contains a smaller image of her holding an identical object, which in turn contains a smaller image of herself holding an identical object, and so forth. 1904 Droste cocoa tin, designed by Jan Misset

Ouroboros, an ancient symbol depicting a serpent or dragon eating its own tail.

Recently refreshed sourdough, bubbling through fermentation: the recipe calls for some sourdough left over from the last time the same recipe was made.

Recursive dolls: the original set of Matryoshka dolls by Zvyozdochkin and Malyutin, 1892