4 ms·
I find these benchmarks slightly dubious because everytime I look into the actual code I find that is written some obscure manner. For example - here is the co
by chvid 12y ago
I find these benchmarks slightly dubious because everytime I look into the actual code I find that is written some obscure manner.
For example - here is the code of the Java "knucleotide" benchmark:
http://benchmarksgame.alioth.debian.org/u64q/program.php?test=knucleotide&lang=java&id=7 http://benchmarksgame.alioth.debian.org/u64q/program.php?tes...
(If I understand the website correctly.)
Look at the way data is read (scanPastHeader, readRestIntoByteArray, fullSequence).
Or how the result of calculateHash is put into a HashMap where it immediately would be hashed again.
I think this is neither the most natural or performant way of solving the problem in Java.
- rockdoe 12y agoSo submit an improved version?
- igouy 12y agoCurrently 7 Java k-nucleotide programs are shown. > the most natural or performant way of solving the problem in Java "How to contribute programs" http://benchmarksgame.alioth.debian.org/play.html#contribute http://benchmarksgame.alioth.debian.org/play.html#contribute