JSR-166: The Java fork/join Framework

The JSR-166 are concurrent utilities that were included in Java 5.  The fork/join framework was a piece of it that didn’t make it into Java 5.  After all this time the fork/join framework is finally making it into JDK 7.  What surprised me about the framework is that it is so easy to use. The […]

Posted on March 9, 2010 at 10:53 pm by Joe · Permalink · 14 Comments
In: Java · Tagged with: ,

Sort Optimization (Part 2) with JDK 6 vs JDK 7

In part 1, I went over my first foray into the world of sorting algorithms.  Since then, I’ve had some other ideas on how to improve my quicksort implementation.  One idea that I had while originally working on the sorting algorithm, was to rework the partition function to take into account duplicate elements.  I had […]

Posted on December 23, 2009 at 11:00 am by Joe · Permalink · Leave a comment
In: Java · Tagged with: , ,

Sorting Algorithm Shootout

Since I did my Sort Optimization post, I’ve been keeping an eye on things that happen in the sorting world.  Recently an article popped up on Reddit about someone wanting to replace the JDK sorting algorithm with a Dual Pivot Quick Sort.  This lead to the discovery that Tim Sort would be replacing Merge Sort […]

Posted on October 8, 2009 at 10:00 am by Joe · Permalink · 3 Comments
In: Java · Tagged with: ,

Sort Optimization

This all started one night when I was in the #JRuby channel on irc.freenode.net.  A channel user was complaining about JRuby’s sorting algorithm being slow.  I thought to myself, I should be able to speed it up.  At the time I was thinking since sorting has been so well researched it’d likely be easy to […]

Posted on November 15, 2008 at 1:31 pm by Joe · Permalink · 3 Comments
In: Java, Ruby · Tagged with: , , ,