[Shootout-list] Re: Coding For Speed

[Robert Seeger]

It's not so much interesting because it's nifty, but interesting
because it's an "if you were really going to calculate this in this
language, this is how you'd do it" alternative.

Rob Seeger


On Sat, 26 Mar 2005 18:37:24 -0800 (PST), Isaac Gouy <igouy2@yahoo.com> wrote:
> --- Robert Seeger <rhseeger@gmail.com> wrote:
> > Actually, my comment in this thread was not about there being an
> > iterative version of the test. Instead, it was about highlighting the
> > "alternate submissions" section as a place to show implementations
> > that are nice, but don't really fit into the rules of the Shootout.
> 
> Ackermann is so simple I'm not sure what an alternate submission would
> be like. imo iterative wouldn't be interesting.
> 
> The off-the-wall multi-threading count-words implementation they've
> been discussing on the Ada list would be an "interesting alternative
> program"
> 
> __________________________________
> Do you Yahoo!?
> Yahoo! Small Business - Try our new resources site!
> http://smallbusiness.yahoo.com/resources/
> 
> _______________________________________________
> Shootout-list mailing list
> Shootout-list@lists.alioth.debian.org
> http://lists.alioth.debian.org/mailman/listinfo/shootout-list
>