Recursive routines - execution order

[WSinc]

I was wondering if when a recursive routine calls itself, what happens to statements AFTER the call.

Example:

subroutine SUB1(isq)

call sub1(isq+1)

print *,"Does it ever get here?"

print *,isq+1

end

Now if it has a condition such that it SKIPS the call to itself, it will reach the PRINT statement.

But I have seen situations where it got there anyway, and I can't figure out why that would happen.

[WSinc]

I meant to say RECURSIVE - sorry.

[Steven_L_Intel1]

In your example, no. You will eventually get a stack overflow. A correctly written recursive routine will return when it finds it doesn't need to recurse further.