Difference between revisions of "Recursion"

m (See also)
m (Examples: -- funny whoever did that - finally got noticed)
Line 13: Line 13:
 
* Use of recursion to compute an explicit formula: [[2006_AIME_I_Problems#Problem_13| 2006 AIME I Problem 13]]
 
* Use of recursion to compute an explicit formula: [[2006_AIME_I_Problems#Problem_13| 2006 AIME I Problem 13]]
 
* Use of recursion to count a type of number: [[2007 AMC 12A Problems/Problem 25]]
 
* Use of recursion to count a type of number: [[2007 AMC 12A Problems/Problem 25]]
* Yet another use in combinatorix [[2008 AIME I Problems/Problem 11| 2008 AIME I Problem 11]]
+
* Yet another use in combinatorics [[2008 AIME I Problems/Problem 11| 2008 AIME I Problem 11]]
  
 
== See also ==
 
== See also ==

Revision as of 14:12, 28 November 2009

Recursion is a method of defining something (usually a sequence or function) in terms of previously defined values. The most famous example of a recursive definition is that of the Fibonacci sequence. If we let $F_n$ be the $n$th Fibonacci number, the sequence is defined recursively by the relations $F_0 = F_1 = 1$ and $F_{n+1}=F_{n}+F_{n-1}$. (That is, each term is the sum of the previous two terms.) Then we can easily calculate early values of the sequence in terms of previous values: $F_0=1, F_1=1, F_2=2, F_3=3, F_4=5, F_5=8$, and so on.

Often, it is convenient to convert a recursive definition into a closed-form definition. For instance, the sequence defined recursively by $a_0 = 1$ and $a_n = 2\cdot a_{n - 1}$ for $n > 0$ also has the closed-form definition $a_n = 2^n$.

In computer science, recursion also refers to the technique of having a function repeatedly call itself. The concept is very similar to recursively defined mathematical functions, but can also be used to simplify the implementation of a variety of other computing tasks.


Examples

See also

Invalid username
Login to AoPS