bertie wrote: [...] > Exactly. I started to compare them. Couldn't do more, question of time. Extremely interesting, but I'd recommend checking out The Great Language Shootout --- http://shootout.alioth.debian.org. Benchmarking is really a hard. From looking at your Fibonacci code, for example, I suspect that what it's actually measuring is how long it takes to allocate stack frames; it's calling fib() a *lot of times*. This means that the results don't necessarily mean anything in the real world. (The GLS gets around this by using lots of different benchmarks, all of which solve real-world problems. Any Neko users here want to write a bunch of benchmark implementations?) (Incidentally, your bar charts look awfully strange --- how come the high numbers have shorter bars than the low numbers?) -- +- David Given --McQ-+ "Gaping from its single obling socket was | dg@cowlark.com | scintillating, many fauceted scarlet emerald..." | (dg@tao-group.com) | --- Jim Theis, _The Eye of Argon_ (spelling +- www.cowlark.com --+ original)
Attachment:
signature.asc
Description: OpenPGP digital signature