[Shootout-list] New benchmark?
Isaac Gouy
igouy2@yahoo.com
Fri, 17 Dec 2004 14:52:37 -0800 (PST)
> If programmer A discovers that an insertion sort is the most
> concise sort in language X, and programmer B discovers that
> quicksort is the shortest in language Y, then when I come along
> and see that A's program is 15% faster but B's program is 5
> instead of 20 lines of code, I'll probably think B's language is
> better.
As each programmer used a different algorithm, we really don't have
evidence to support any conclusion.
> If an implementor decides to use a different algorithm, it
> tells us that the original algorithm was hard to code in that
> language, or it resulted in an ugly, unmaintainable program. Or a
> much more natural approach was available in that language.
All we know is that they used a different algorithm.
Maybe it's the only one they know.
> Of course, you could also reverse the question and ask, "What
> do the times and memory usage tell us about the object
> instantiation benchmark in languages like C, which don't have
> objects?"
I agree - we just haven't got to fixing those benchmarks yet, we will.
__________________________________
Do you Yahoo!?
All your favorites on one personal page – Try My Yahoo!
http://my.yahoo.com