Subroutine recursion

koushuai

Do you need to consider the size of the stack when recursive subroutine calls? Such as
power (x, n)
If N = 10, then 20 parameters are on the stack. If N = 1000 or more, isn't the stack going to explode!

qqion1988

To consider the size of the stack, too small stack will overflow.

www_james

Not only to consider the parameters, but also the return address of the subroutine also needs to occupy the stack. In addition, there may be local variables in the subroutine that will also occupy the stack. So, sometimes non-recursive methods

bluedick36

Or you can use functional languages ​​such as scheme, generally do not have to consider stack overflow