EStackOverFlow

When run the code below:

Code:

void F()
{

  F();

}

EStackOverFlow will appear.
The book says that there is a loop going on. Can anyone explain to me?
Because I think in the Void F function, it will only use itself once.

You're looking at infinite recursion. Yes, F only calls itself once, but the call to F calls itself once, which calls itself once, which... the sum of all energy-matter in the universe is insufficient for me to express this in full.

Oh. I get it.

What about the following code?

Code:

void F(int a)

         {
       F(a+1);
         }

What's the terminating condition (or base case)?

Umm.. What is the meaning of 'terminating condition' ?

Didn't your book give you examples of recursion?

Sorry. my book is in Chinese.

Okay, basically: when does the recursion end? Trace through the code and find out.

When the condition is not satisfied.

So, what is the condition?

In the code I have given ? Or?

Yes, the code in post #4.

um.. after f(a+1)?

Is that an answer to my question or is that a question?