Hi another recursive question: every time the function call itself, a new instance is copied on the stack?, or am i wrong? ( im trying to learn C, please dont shoot me).
Hi another recursive question: every time the function call itself, a new instance is copied on the stack?, or am i wrong? ( im trying to learn C, please dont shoot me
a new instance of what? function is not an objecta new instance is copied
All problems in computer science can be solved by another level of indirection,
except for the problem of too many layers of indirection.
– David J. Wheeler
The parameters and return address is indeed pushed onto the stack, and when the recursive function call returns, they are popped back off the stack.Originally Posted by pic-o-matic
Hi another recursive question: every time the function call itself, a new instance is copied on the stack?, or am i wrong? ( im trying to learn C, please dont shoot me
--
Mats
Compilers can produce warnings - make the compiler programmers happy: Use them!
Please don't PM me for help - and no, I don't do help over instant messengers.
