CS232, Spring 2008

JVM Extra Credit Programming assignment JVM3-3

Due: Friday, May 9 (last day of classes)

Assignment

Redo Exercise JVM3-2 so that it uses a different sorting routine than Selection Sort. More extra credit will be earned if you use a recursive sorting algorithm such as Merge Sort or Quick Sort.

Notes

• You do not need to use the findIndexOfMax method from Exercise JVM3-1.
• You can implement several different sorting routines for even more extra credit.
• This extra credit exercise is due Friday, May 9 (the last day of classes). No late assignments will be accepted.
• This extra credit exercise must be done individually instead of in a team.
• The extra credit points you earn are equivalent to exam points.
• The number of points of extra credit points you get will depend on the difficulty of the problem and the readability and correctness of your solution.
• Little or no credit will be given for half-hearted attempts. That is, I expect significant progress to be made before I give any extra credit.

What to hand in

Please hand in a hard copy of your JVM3-3.a assembly language code and attach an electronic copy to an email message to me.