By cretzel
via stronglytypedblog.blogspot.com
Published: Feb 07 2010 / 16:39
This is a follow-up of my last post, where I compared the runtimes of the quicksort algorithm implemented in Java, Scala, Groovy and Groovy++. Groovy++ came up with a significant improvement over Groovy. But there was a comment by ait (Thanks ait) on how to improve the performance of the Groovy++ implementation even further, by changing a single line. In fact, this improved the performance dramatically.
Add your comment
Voters For This Link (50)
-
aalmiray -
ksprague -
thevery -
fifthposition -
freq47 -
xymor -
alext -
cretzel -
rsaddey -
shamsm -
loxal -
paulk_asert -
mschab -
opensas.myopenid.com -
dbleyl -
mswatcher -
mikewitters -
shantanu_k06 -
vaclav -
michele.mauro -
_mnemonic -
mitite -
jakinik -
yoram -
toomone -
ip21650 -
openid-provider.appspot.com/vgrichina -
aliz -
juriy -
bscarr -
cfelde -
johanlund@mac.com -
dubness -
dscho -
ran_at_bindows -
tmo9d -
daveklein -
gb33229 -
bloid -
mzgubin -
mbetter -
han.solo -
joergM -
Konstantin.Scheglov -
dinoderek -
adamgmetzler -
jobaer -
bootz15 -
awgatsby -
mario.fusco