Tail recursion optimized? Topic is solved
Tail recursion optimized?
Does anyone know if tail recursive calls are optimized in v2? In other words, if a recursive call is the last statement in a function, does the interpreter free the stack space of the penultimate call? I think the answer is no, based on a quick test I did with deep recursion. As I'm refactoring for beta1, I didn't want to waste time changing non-tail to tail recursion if the interpreter is indifferent between them. Thanks so much.
Re: Tail recursion optimized? Topic is solved
they're not