Re: [clisp-list] tail recursion optimization

[Elvin P. <elv...@ya...>]

--- Edi Weitz wrote:

> On Thu, 29 Jul 2004 06:35:56 +0200, Pascal
> J.Bourguignon wrote:
> 
> > Do you believe that max_cycle_len(1,1000000) would
> take only 0
> > second in C? (While still giving you correct
> results on a 32bit
> > processor?)
> 
> You can try yourself:
> 
>  
>
<http://online-judge.uva.es/problemset/data/p100.c.html>
> 
> Of course, it doesn't complete in 0.0 seconds - I
> killed the program
> after it had consumed 100% of my CPU (PIII 1200) for
> about five
> minutes. And of course, as Sam Steingold has pointed
> out, this
> "solution" fails miserably as soon as the numbers
> involved don't fit
> into 32 bits anymore while a Lisp program will yield
> correct results.

Ack!  If you can't trust a random site on the
Internet, who can you trust?  However, in their
results page, they had the top 20 people finishing
with time 0.00.

Thanks again to all those who replied.


		
__________________________________
Do you Yahoo!?
Read only the mail you want - Yahoo! Mail SpamGuard.
http://promotions.yahoo.com/new_mail