From: Nikolai Weibull Date: 2005-03-16T22:57:11+09:00 Subject: Re: Fibonacci Benchmark Correction * jzakiya@mail.com (Mar 16, 2005 14:40): > The Great Computer Language Shootout Benchmarks > http://shootout.alioth.debian.org/ > is using an incorrect fibonacci algorithm benchmark. I really don't see where you're going with this. The sequence is either 0 1 1 2 3 5 8 13 ... or 1 1 2 3 5 8 13 ... Of course, the first makes more sense, but both are almost equally quoted as the Fibonacci sequence. The first is, as I said, more right, as you also point out, but it doesn't really matter as far as the benchmark goes. If everyone implements the algorithm that the benchmark states, then it really won't matter where the sequence begins, nikolai -- ::: name: Nikolai Weibull :: aliases: pcp / lone-star / aka ::: ::: born: Chicago, IL USA :: loc atm: Gothenburg, Sweden ::: ::: page: www.pcppopper.org :: fun atm: gf,lps,ruby,lisp,war3 ::: main(){printf(&linux["\021%six\012\0"],(linux)["have"]+"fun"-97);}