Timeline for Different factorial algorithms
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 27, 2015 at 22:47 | comment | added | steenslag |
Math.gamma(171), it returns Infinity for larger values. There is also Math.lgamma
|
|
| Feb 23, 2015 at 19:34 | vote | accept | NPN328 | ||
| Feb 23, 2015 at 18:37 | history | edited | 200_success |
edited tags
|
|
| Feb 23, 2015 at 18:28 | comment | added | Devon Parsons |
The Stirling Approx. method should be validating that n <= 170, if anyone can think of a good way to incorporate that (perhaps send something into the validate function as an optional param?) that would be another good answer
|
|
| Feb 23, 2015 at 18:13 | answer | added | Devon Parsons | timeline score: 3 | |
| Feb 23, 2015 at 18:07 | history | edited | NPN328 | CC BY-SA 3.0 |
added 2 characters in body
|
| Feb 23, 2015 at 17:58 | history | asked | NPN328 | CC BY-SA 3.0 |