Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » geometry.puzzles.independent

Topic: Discrete Math
Replies: 3   Last Post: Nov 4, 1996 8:47 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
mfried1@earthlink.net

Posts: 4
Registered: 12/10/04
Re: Discrete Math
Posted: Nov 4, 1996 8:47 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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(n-1)! 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???
>






Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.