[Shootout-list] Directions of various benchmarks

[Bengt Kleberg]

On 2005-05-20 02:25, Jon Harrop wrote:
...deleted
> programs. Any data structures and algorithms can be used. For each language, 
> the shootout should contain the fastest program <100 LOC or, if there are 
> none, the shortest program >100 LOC.

does this mean that if a fast and verbose language (>100 LOC) is 
sufficiently important to slow down, then somebody would spend time on 
making a shorter, but slower solution?

i do not say this is always a bad thing, i only wonder if this 
potentially could be a problem?


bengt