That doesn't gibe. Here's the two sequences, as I understand them.

Standard recursion:

1. First call to func(). (Create first frame on the stack)
2. Second call to func(). (Create second frame on the stack)
3. Return from second call. (Destroy second frame on the stack)
4. Return from first call. (Destory first frame on the stack)

goto ⊂

1. First call to func(). (Create first frame on the stack)
2. goto ⊂ (Destory first frame, create first frame)
3. Return from goto call. (Destory first frame)

I count two creations and two destructions of a stack frame. What am I missing? Plus, since goto ⊂ doesn't have such a large stack, it takes less memory and lookups take less time. Right?