develooper Front page | perl.fwp | Postings from November 2001

Re: Feel good benchmarks

Thread Previous | Thread Next
From:
_brian_d_foy
Date:
November 22, 2001 01:39
Subject:
Re: Feel good benchmarks
Message ID:
comdog-D1C908.19153721112001@nntp.perl.org
In article <20011121131114.A19638@blackrider>, schwern@pobox.com 
(Michael G Schwern) wrote:

> On Wed, Nov 21, 2001 at 09:51:32AM +0200, Ariel Scolnicov wrote:
> > > 139423224561697698330489613862193018947914545343780323868775030943672596190605867771863846635039486902272
> >
> > For mission-critical enterprise-level high-throughput Fibonacci
> > generation, you want to logarithmic-time algorithm.
> >
> > <hal2 92 [9:50] ~/Tests >/usr/bin/time ./fib-fast 500
> > 139423224561697873388268830107091057642465893024716039229340111610069135233925734164006795046787674537984
> >
> > Algorithms count!

indeed, that's why there is a better one. :)

    http://www.ddj.com/documents/s=1498/ddj0104pl/

or

    http://search.cpan.org/doc/MJD/Memoize-0.66/Memoize.pm

> So does correctness, yours gives the wrong answer.

that's nice, but not always an enterprise requirement in my 
experience ;)
-- 
brian d foy <comdog@panix.com> - Perl services for hire
CGI Meta FAQ - http://www.perl.org/CGI_MetaFAQ.html
Troubleshooting CGI scripts - http://www.perl.org/troubleshooting_CGI.html

Thread Previous | Thread Next


nntp.perl.org: Perl Programming lists via nntp and http.
Comments to Ask Bjørn Hansen at ask@perl.org | Group listing | About