Alistair Tucker wrote: > > Sorry this is likely a naive contribution, but I've often wondered why J > doesn't appear in these comparisons. > Surely this one "The Great Win32 Computer Language Shootout" > (http://dada.perl.it/shootout/) can't insist on open source - it's got MS > Visual C#. > Alistair >
While benchmarking is definitely very important, it is not easy to develop a general benchmark for any and all languages that compares their speed/memory use in some unequivocal manner. Benchmarks are then very interesting thing in their own peculiar way, and it would be great fun (and very beneficial) to get J into all those tests. I've looked at one example from the link you give, that of "List operations" (http://dada.perl.it/shootout/lists_allsrc.html) The lists they're using are just arrays of integers, so here I think J wins :) Anyhow, one part of the test says: "remove each individual item from right side of L3 and append to right side of L2 (reversing list)". This can be done by: (append L2(reverse L3)) or even (append L2(nreverse L3)) just like in "append to L2 the reverse of L3". The test program used on the site, however, sort of goes element by element through the lists ("word at a time" as Backus would say), so (one part of) their solution is: (setf L3 (nreverse L3)) (setf L2 (with-collector (conc) (loop while L3 do (conc (xpop L3))))) with meticulously crafted with-collector and xpop macros and a global variable (totaling about 10 lines). One curiously tedious solution IMHO. -- View this message in context: http://www.nabble.com/Computer-Language-Benchmarks-Game-tf4922865s24193.html#a14180232 Sent from the J Programming mailing list archive at Nabble.com. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
