Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Re: Discrete Math
Posted:
Nov 4, 1996 8:47 AM


Recursion is where a mathmatical function is defined in terms of itself. For example, the factorial function can be defined by the rule n! = n(n1)! with the special case that 0! = 1.
Modern computer programming languages support recursion. Use of recursion in programming can result in elegant solutions but is not usually the most efficient approach.
Craig <ctracey@providence.edu> wrote in article <3278566E.1F2@providence.edu>... > Can anyone tell me about recursion??? >



