Fundamental Algorithms in Java: We can build this sort better, we can build this sort faster!

Due: March 13, 2009

Implement a fast sorting routine to your doubly linked list program from the previous homework. In particular, the goal is to implement a routine that will sort a collection of students faster than java’s Collections.sort() method. To make sure your sort is fast, you should generate a large number of random students (500,000 or so) and insert each student into both your linked list and javas. Sort your list with your algorithm and sort the java linked list using Collections.sort(), timing each sort to see which is faster. Your grade will be based on how much faster your sort performs. Turn in a typed report showing how your sort performed against java’s for different list sizes.

You may use any of the built in data structures or algorithms java has to offer to solve this problem. In fact, you may use java’s built in sort function if it helps.

You may make the following assumptions:

-You will be sorting items of type Student by GPA which is a value of type double from 0.0 to 4.0.

-I will test this code on a machine with a quad-core processor.