Difference between revisions of "Recursion"

m (fixed some LaTeX)
m (proofreading)
Line 1: Line 1:
'''Recursion''' is defining something in terms of a previous term, function, etc. For example, the famous [[Fibonacci sequence]] is defined recusively. If we let <math>F_n</math> be the nth term, the sequence is: <math>\displaystyle F_0=1, F_1=1, F_2=2, F_3=3, F_4=5, F_5=8</math>, and so on. A recusive definition is: <math>F_{n+1}=F_{n}+F_{n-1}</math>. That is a symbolic way to say "The next term is the sum of the two previous terms".
+
'''Recursion''' is defining something in terms of a previous term, function, etc. For example, the famous [[Fibonacci sequence]] is defined recusively. If we let <math>F_n</math> be the nth term, the sequence is: <math>\displaystyle F_0=1, F_1=1, F_2=2, F_3=3, F_4=5, F_5=8</math>, and so on. A recursive definition is: <math>F_{n+1}=F_{n}+F_{n-1}</math>. That is a symbolic way to say "The next term is the sum of the two previous terms".
 
== Examples ==
 
== Examples ==
  

Revision as of 13:57, 19 June 2006

Recursion is defining something in terms of a previous term, function, etc. For example, the famous Fibonacci sequence is defined recusively. If we let $F_n$ be the nth term, the sequence is: $\displaystyle F_0=1, F_1=1, F_2=2, F_3=3, F_4=5, F_5=8$, and so on. A recursive definition is: $F_{n+1}=F_{n}+F_{n-1}$. That is a symbolic way to say "The next term is the sum of the two previous terms".

Examples

See also

  • [Combinatorics]