recursion

when i have a recursive function call, what is the mechanism within memory wherein the accumulated values are stored & totaled. in other words, in a for or while type loop, i would explicitly create & increment some sort of an accumulator variable.i can then set up a watch for this variable in a debugger. in a recursive call how do i trace these values as they are modified? it seems that when i try to imagine the results of a recursive call, i am often off by one itteration, so i would like a closer way to examine this mechanism within memory, to help me uinderstand it.
frenomulaxAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

alona041797Commented:
The values are stored in memory as an internal STACK. To view values passed as parameters you could use the "Call Stack" (under window menu). Other variables are usually out of scope and could be viewed only by looking directly at the memory.
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Pascal

From novice to tech pro — start learning today.