I'm reeeally thick at Java. It's not that I don't try; when I read
it I can understand it. I also get the concepts. The trouble comes
when I have to stand on my own two feet and write code from scratch.

Basically I have to implement the MergeSort, QuickSort and HeapSort
algorithms, all separately, to sort a list of N numbers. This has to
be done in a way that can test performance (measuring the running
time) for different values of N.

Can anybody out there help? If I can't produce the results to these
algorithm tests by Monday I fail module (and quite possibly the
year). Eternal gratitude awaits!