RE: [Dev-C++] recursion

[Ioannis V. <no...@ho...>]

-------Original Message-------=0D
 =0D
From: Louis Godio=0D
Date: =D0=E1=F1=E1=F3=EA=E5=F5=DE, 14 =D6=E5=E2=F1=EF=F5=DC=F1=E9=EF=F2 2=
003 4:57:27 =EC=EC=0D
To: Ioannis Vranos; dev...@li...=0D
Cc: dev...@li...=0D
Subject: RE: [Dev-C++] recursion=0D
 =0D
Greets,=0D
Both of your comments raise interesting questions regarding how to=0D
construct efficient run-time code. The simple recursion=0D
factorial(n)=3D n(n-1)..(1); =0D
is easily implemented as either a simple loop or recursion;=0D
BUT could you guys comment on stack space, run-time etc. for a call =0D
like factorial(100) implemented as a recursion compared to a loop ? =0D
=0D
=0D
=3D=3D> Of course. Recursion is very much run-time/space deficient in com=
parison
to loop.=0D
=0D
=0D
=0D
Ioannis Vranos=0D
=0D
* Programming pages: http://www.noicys.freeurl.com=0D
* Alternative URL: http://run.to/noicys=20