You are viewing a single comment's thread. Return to all comments →
I thought this would be a cake walk. Just implement a tail recursive function and call it on N.
...then I realized I was trying to do this in JavaScript.
My function is fine. It works. The answers are right.
BUT THE TESTS FAIL because JS has precision limits and returns answers in Scientific Notation!
Seems like cookies are disabled on this browser, please enable them to open this website
Extra Long Factorials
You are viewing a single comment's thread. Return to all comments →
I thought this would be a cake walk. Just implement a tail recursive function and call it on N.
...then I realized I was trying to do this in JavaScript.
My function is fine. It works. The answers are right.
BUT THE TESTS FAIL because JS has precision limits and returns answers in Scientific Notation!