Earlier quoted context omitted.
So we can immediately dismiss your "Programs are not meant to be written in idiomatic language. They are meant to resemble the C implementation." claims as baseless . The only example you chose shows programs that manually unroll loops are not accepted. (And that's stated explicitly on the Help page. http://shootout.alioth.debian.org/help.php#unroll )
"... we ask that contributed programs not only give the correct result, but also use the same algorithm to calculate that result." (Except for meteor-contest.)
Our experience using Clojure to speed up Beanstalk
71–75 of 75 posts
Re: Our experience using Clojure to speed up Beanstalk
#72Earlier quoted context omitted.
They're optimizing for their business value and resources (programmers) available. It might not impress their programmer friends, but it'll impress their accountant.
Well, in my book using Lisp in production is impressive for the best part of my programmer friends :-)
Re: Our experience using Clojure to speed up Beanstalk
#73Earlier quoted context omitted.
"... we ask that contributed programs not only give the correct result, but also use the same algorithm to calculate that result." (Except for meteor-contest.)
I'm sure you wish to make a point -- please don't make everyone guess what you mean, just spell it out.
Re: Our experience using Clojure to speed up Beanstalk
#74Earlier quoted context omitted.
I'm sure you wish to make a point -- please don't make everyone guess what you mean, just spell it out.
An algorithm that's idiomatic in one language might be terribly unidiomatic in another. (I'm sure you know this, but) Haskell's pervasive laziness makes some algorithms tractable while requiring a lot of space/time complexity for other algorithms.
>>pervasive laziness... requiring a lot of space/time complexity for other algorithmsAnd GHC provides strictness analysis and explicit strictness to avoid reducing performance.
Re: Our experience using Clojure to speed up Beanstalk
#75Earlier quoted context omitted.
I'm sure you wish to make a point -- please don't make everyone guess what you mean, just spell it out.
An algorithm that's idiomatic in one language might be terribly unidiomatic in another. (I'm sure you know this, but) Haskell's pervasive laziness makes some algorithms tractable while requiring a lot of space/time complexity for other algorithms.
Unfortunately, to argue better does require learning what the website says about the benchmarks game - and for most that's far too much effort.