Factorial methods are often written recursively just to show off. Iterative coding with a pedestrian for loop is much faster. Mathematicians like to use a powerful theorem proving technique called induction that works much like recursion, so they are enamoured of it and tend to recursion in Java where it is not warranted.
|
|
available on the web at: |
http://mindprod.com/jgloss/factorial.html |
optional Replicator mirror
|
J:\mindprod\jgloss\factorial.html | |
![]() |
Please email your
feedback for publication,
letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear
wording, broken/redirected link reports, suggestions to improve this page or comments to
Roedy Green :
| |
| Blog | Canadian
Mind
Products
IP:[65.110.21.43] Your face IP:[54.235.20.17] |
|
| Feedback | You are visitor number 23,484. | |