[Shootout-list] fibonacci and ackermann

[Isaac Gouy]

> I'll have to put some thought, and maybe research, into another way
> to solve the problem. Until then, I hold that the Fibonacci test is a
> better test of recursion performance.
 
> > Ackermann is a *lot* of recursion, but it has the advantage of
> > being very nontrivial to optimize away. If you can figure out a
> > recursive function that doesn't optimize away, that would be cool
too.

Given that my changes seem to have trashed the memory usage of the
fibonacci programs, I'm tempted to revert fibonacci to the original
spec and then retire it to The Doug Bagley.

Takfp is recursive also...


		
__________________________________ 
Yahoo! Messenger 
Show us what our next emoticon should look like. Join the fun. 
http://www.advision.webevents.yahoo.com/emoticontest