Are all problems that are solvable with recursion solvable with loop?

Question

All problems that are solvable with recursion are solvable with loop, and vice versa.

Is this statement right or proven at all? sometimes, using recursion causes stack overflow. if the statement is correct. we'd better use loop instead.

thanks

Answer 1

Yes. Loop + Stack will solve all recursion problems.

After all, compiler does that internally. Recursion is nothing but pushing data onto a stack, and later popping from it, done by the compiler.