News for hackers. Stuff that matters.
Re:But the question is: will it recurse? Part 1: fibonacci(40) by maxs on Monday October 10, 2011 @11:44AM (#3094249)
Don't want to get into the language shootouts here. But this seems like a horrible way to compare language performance.

There are many more interesting real-life programs tested on computer language shootout website.

In particular, you can't compare C and JVM performance on programs that run for such a short time. The JVM time will be dominated by the time to start up the the JVM and to do the first JIT optimization. I think it is very likely that for a larger fibonnaci number, the JVM performance will come asymptotically close to optimized C's.

Re:But the question is: will it recurse? Part 1: fibonacci(40) by SaltwaterC on Monday October 10, 2011 @11:59AM (#3094324)
This may be the subject for a part 2. Aka more intensive testing for the implementations that actually perform. And other recursive algorithms (such as the classic factorial). I didn't test the language (implementation!) performance, but the recursion and how the various implementations can actually handle the bad recursion algo.

A proper testing suite that tests various aspects of a specific runtime takes time. I am aware of that, but I am not aware of any test suite that does this.