yes. You should be able to convert any recursive function/method to a
non-recursive one by just simulating what the language does to do the
recursion.
This usually involves using stack (recursion stack) to store function
local variables before doing another call.
Haven't looked at this closely but
understood thanks for ur concern
On 6/7/08, Ashesh <[EMAIL PROTECTED]> wrote:
>
>
> 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 convert
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 r
On Jun 6, 1: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 ...
All. In fact there are s
