Assignment 3
Implement a 2-way external merge sort of the same words file as
assignment 3
(http://gee.cs.oswego.edu/dl/csc365/words). Use a
heap-based priority queue for initial runs. Measure the time
(in milliseconds) that it takes to sort (use
System.currentTimeMillis). Also write a simple
verifier that checks to see that your output is sorted. Submit
a table showing the times for heap sizes of 10, 100, 1000, and
10000.
Doug Lea
Last modified: Fri Nov 17 05:56:21 EST 2000