Space complexity of recursive algorithm

Question

I was asked at an interview, the efficient way to solve a problem checking for pallindrome.

Now i can do two things:

1. starting from i = 0 to i = n/2 and comparing ith and n-ith character to be equal.
2. I can use recursion to check if first and last are same and the rest of the string is a pallindrome.

The second is recursive. My question is what is the difference in the space complexity of an algorithm's recursive and non-recursive versions?

Answer 1

Have a read at

1. http://www.codeproject.com/Articles/21194/Iterative-vs-Recursive-Approaches
2. Recursion or Iteration?

Basically, a recursive algorithm will add overhead since you store recursive calls in the execution stack.

But if the recursive function is the last line of the call (tail recursion) then there is no additional penalty.

That is of course both algorithms are the same.

Answer 2

In theory they have the same space complexity; it largely depends on whether tail recursion can be optimized.

If so, the stack gets replaced at every recursion so it doesn't incur a penalty.