As the page says, "No. Which programming language implementations have the fastest benchmark programs?" Which begs the question - aside from macho bragging rights, exactly what good is this kind of information? Assume I did have a specific problem case for which performance in terms of memory, time or LoC mattered. As a first step, I'd write a specific benchmarkable implementation of my own problem (or one very like…
It matters sometimes. A while back, I wrote a program to solve a puzzle. The more complex the puzzle, the longer it took to solve. Today, I might come up with a better algorithm, but back then, all I could find was a brute-force approach. The most complex puzzle I had seen at the time was taking hours to run. The program was written in VB6, and it was just wasn't mean for CPU-intensive programs like that. If I were t…
I bet that you could come up with a better algorithm now, even in VB6 if you had to, to get the run time down. I've seen people take "optimised" C solutions that run in hours and make them run in minutes, just by rewriting the algorithm and rethinking basic assumptions.