For program 2, implement merge sort. MAKE SURE YOU FOLLOW THE BOOK!

Same sorting plan as with Insertion Sort (largest to smallest), same input format. Submit this through the Blackboard Digital dropbox, and please tag this as "PROGRAM 2".

Due: February 12th, 2009 (before Midnight).

Some things to note:

• Put your name into the source code comments!
• Make sure you sort in reverse order (largest to smallest)
• Please don't submit things in a TAR/RAR/TGZ file. You only need one file to implement everything, and a Makefile is not required. I can unzip/untar, but it's a hassle.
• Don't put in any extra output, or prompting. It makes automatic checking of the output difficult.
• The code should compile.
• The code should not be windows-specific. It should compile and run on Unix machines.

Prior grading deducted 1 point for a missing name; I'll increase this to 3.

5 points off for printing in the wrong order.

10 points off if it doesn't work (and have a O(n log n) complexity).