Recursive function overflow

Question

Hey I built a working recursive function that finds the Longest Common Sequence between two strings. http://en.wikipedia.org/wiki/Longest_common_subsequence_problem It works perfectly fine and it is fast cause I use a memiozation table so that I'm not calling something that I've previously called already. My problem lies that when I have strings over 150 characters I get a call stack overflow. I was wondering if anyone knows of a good suggestion to fixing this or of a better way of finding the longest common subsequence.

Sam Hobbs · Answer

The problem with recursion is that it uses stack space which is a limited resource. You should use iteration instead of recursion since the level of recursion for large strings is obviously excessive.