Re: need help Recursion and iteration...

To: CALC-TI@LISTS.PPP.TI.COM
Subject: Re: need help Recursion and iteration...
From: werner_huysegoms@MY-DEJANEWS.COM
Date: Tue, 22 Dec 1998 07:54:48 GMT
Organization: Deja News - The Leader in Internet Discussion
References: <367b19b8.20616889@news1.qc.sympatico.ca> <19981219121709.07206.00001255@ng-fd2.aol.com> <75gnlr$se4@raven.slic.com> <01be2c12$498f15a0$2f71f9c3@kasper> <367d657d.20892851@news1.qc.sympatico.ca>
Reply-To: werner_huysegoms@MY-DEJANEWS.COM
Xref: paladin.american.edu bit.listserv.calc-ti:27048

In article <367d657d.20892851@news1.qc.sympatico.ca>,
  bmorrissNOSPAM@sympatico.ca (Benoit Morrissette) wrote:

>  But there
> exists some classes of algorythmic problems that can be solved
> only through recursion ( graphs and trees ).

Er.. no.  Every recursive program may be written in iterative form.
It's not always trivial (as with the factorial), but it can be done.

> And in many
> cases, recursion leads to programs that are more readable,
> easier to debug and faster to write at the cost of using
> more memory and taking more time to run.
>

I second that.

--
Best Regards,
Werner Huysegoms
Reply-To: werner.huysegoms@dgx11.cec.be
remove the x before replying

-----------== Posted via Deja News, The Discussion Network ==----------
http://www.dejanews.com/       Search, Read, Discuss, or Start Your Own

Follow-Ups:

Re: need help Recursion and iteration...

From: Benoit Morrissette <bmorrissNOSPAM@SYMPATICO.CA>

Re: need help Recursion and iteration...

From: "Randolph J. Herber" <herber@DCDRJH.FNAL.GOV>

References:

From:

From:

From:

From:

From: