I'm curious about the results vs normal recursion but surely the straight iterative version would be faster.
Only if you were using a very functional style would this potentially be a useful place to look for speed, but in that case you'd probably want to do it in the compiler/optimizer rather than by hand. (Waffling here...)
In reply to Re: Re: Tail Recursion "Optimising" with goto &sub
by bsb
in thread Tail Recursion "Optimising" with goto &sub
by bsb
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |