As we implement factorial using recursion .But there is problem with it as it was not able of compute even a number !99 with the code. Is there any efficient way to approach it
Regarding factorial number using recursion
99! factorial is very very large number, infact the max factorial you can calculate without integer overflow is of 24. The code has limitations because of integer overflow.
then how to solve it
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.