in reply to Re^4: Syntactic sugar for tail call optimizations
in thread Syntactic sugar for tail call optimizations
This thread is about implementating tail call recursions, thanks for trolling with a graph-search recursion which isn't tail code.
Oh, sorry. I thought you'd know that every recursive algorithm can be made into a tail-recursive one(*).
So you see there is no trolling and no polemic; just an example, as you requested, that you don't know how to handle.
And, BTW, one disproves your flimsily expounded theory.
* All you need to do is implement the CPS transform.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^6: Syntactic sugar for tail call optimizations
by LanX (Saint) on May 27, 2011 at 17:21 UTC | |
by BrowserUk (Patriarch) on May 27, 2011 at 18:46 UTC | |
by LanX (Saint) on May 28, 2011 at 10:28 UTC | |
by Anonymous Monk on May 30, 2011 at 00:03 UTC | |
by LanX (Saint) on May 30, 2011 at 11:59 UTC |