Recursion is so cool. If you're willing to practice, I'd recommend you to try SML.
On Jun 6, 10:40 pm, "zee 99" <[EMAIL PROTECTED]> wrote: > hi > > learnt that a tail recursive algorithm can be converted to a non recursive > one by merely using a while and a goto > > is it true for all class of recursive algorithms or just the tail recursive > ones ... > > if all recursive ones can be converted , then do we have a general procedure > ??? > > thanks > > zee --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
