11

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?

2 Answers 2

10

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.

Sign up to request clarification or add additional context in comments.

Comments

1

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.

4 Comments

For large data sets , even with tail recursion , will lead to StackOverflow error . No?
@Sudhakar That's exactly what tail recursion optimisation prevents :)
Is this program a valid example of Tail Recursion. This produces stackoverflow . Pls correct me if iam wrong. <pre> public class TailTest { public static void main(String[] args) { System.out.println(TailTest.iterate(100000)); } public static long iterate(int n){ if(n==1) return 1; return iterate(n-1); } } </pre>
@Sudhakar In that case, there's no tail recursion optimisation being done.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.