Recursive Function
Jump to navigation
Jump to search
A Recursive Function is a Function whose Function Definition includes a reference to the Function.
- Example(s):
- ƒ(n) = ƒ(n-1) + ƒ(n-2), for The Fibonacci Number Sequence
- See: Recursive Rule, Sequence.
References
- http://en.wiktionary.org/wiki/recursive_function
- (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Recursive_function_theory
- http://en.wikipedia.org/wiki/Recursion_(computer_science)