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.
![]() ![]() |
This page is posted |
http://mindprod.com/jgloss/factorial.html |
Optional Replicator mirror
|
J:\mindprod\jgloss\factorial.html | |
![]() |
Please read the feedback from other visitors,
or send your own feedback about the site. Contact Roedy. Please feel free to link to this page without explicit permission. | |
Canadian
Mind
Products
IP:[65.110.21.43] Your face IP:[3.142.201.19] |
| |
Feedback |
You are visitor number | |