as i know that the memory of each recursive call is stored in a stack, so making many recursive calls may cause a stack overflow problem ,my question is what happens if we call factorial(5) and factorial (1000)?
-
-
It depends on how your function is defined. I imagine factorial(5) wouldn't have too big a problem, but factorial(1000) may be too big, depending on the computer you're using and the function definition. -
factorial(1000) may overflow your stack if it is defined recursively; furthermore, 1000 factorial is too big for even a 64-bit integer. However, factorial can be defined with a for loop, rather than recursion.Comment
Comment