Alternatively, adding some kind of memoization can reduce run time and stack size pretty significantly for some algorithms.

e.g. if you're using recursion to compute fibonacci, you're re-computing quite a lot of steps by default