> Stack overflow
Well, yeah, other than tail recursion with tail call optimization, stack consumption, if not stack overflow, is always an issue.
> and honestly many recursive algorithms are quite hard to parse in your head especially once you add some edge cases and some other entropy.
I find lot of things are easier to conceptualize recursively than iteratively, though parsing really depends a lot of the language.