today i compared the running times of the quicksort algorithm implemented in java, scala and groovy. i took the scala implementation from 'Scala By Example' [available on scala-lang.org] and based on that i wrote the other two. i ran a test on an array of 1.000.000 integers. the algorithms were not optimized for each particular language [but i compiled the groovy file at least] and i don't really know if these results are quite representative. but anyway, here are the running times:
java: 280 ms
scala: 359 ms
groovy: 535250 ms
Subscribe to:
Post Comments (Atom)
Posts
2 comments:
Please consider posting the source code, environment settings and how you timed every output, otherwise those numbers don't make much sense :-[
thanks for the feedback. i got the source code up. see the post on June 20
Post a Comment