Sounds like your function is being a bit too eager to call itself. The first thing to check is whether you really need recursion at all – sometimes a simple loop does the trick and you get rid of the stack overhead completely. If you’re stuck with recursion, make sure it’s tail‑recursive; most compilers will optimize that for you. If not, memoize the intermediate results – you’ll keep the depth shallow and you’ll double‑up on space instead of stack. Finally, if you’re really unlucky, bump up the stack size or use a language that supports true tail‑call optimisation. Keep the depth to a sane constant, and the stack won’t feel like a black hole.

Nice, you've got the basics. Just remember, if your stack keeps growing, the algorithm's probably just enjoying the drama. Keep the recursion tight and the memo table lean, and you’ll have a tidy stack in no time.