COSC 311 Homework 12/5/2016
Due: 12/12/2016

Merge sort

Implement internal merge sort. Maintain a counter that increments every time
mergesort is invoked.

The input to your program -- the following strings
ikeji
bahorski
chaudhuri
evett
haynes
maniccam
moore
narayanan
panja
poh
sverdlik
tehranipour
zeiger
zhang
cowan
francis
mansour

Output from your program:
 - the sorted list (one per line)
 - the counter
 
Constraint on your code:
(1) You MUST use Java's Array class (not ArrayList)
(2) You MUST override Array's sort() routine to sort Strings using mergesort
    and maintaining the counter. 

Turn in:
  Hardcopy of your code.
  Output of run.
  In your code, include a header:
      [your name]
      [URL of code]
      COSC 311
      HW 1121
      FALL 2016.
  Do not supply UML diagram for your code.