Recursion is the process of defining a problem (or the solution to a problem) in terms of (a simpler version of) itself. For example, we can define the operation "find your way home" as: If you are at home, stop moving. Take one step toward home.

A function is called a recursive function if it calls itself again and again . Recursion can be direct as well as indirect. Direct recursion is when a function calls itself. Whereas indirect recursion is when a function calls another function and the called function in turn calls the calling function.

The ability to mindread recursively-for example, by thinking what person 1 thinks person 2 thinks person 3 thinks-is a prime example of recursive thinking in which one process, representation, or idea becomes embedded within a similar one.

Recursion is the technique of making a function call itself. This technique provides a way to break complicated problems down into simple problems which are easier to solve. Recursion may be a bit difficult to understand. The best way to figure out how it works is to experiment with it.