COMMENTS on the solution to hw3

Programming Part:

-- The really new methods you need to write are
	sort, split and merge.

-- Sort is trivial, with these steps:
	1. return immediately if base case
	2. split into 2 lists (odd and even)
	3. call sort on the odd and even sublists (recursively)
	4. return the merge of the sorted sublists

-- Note: your code should not perform any
	new allocation of myNodes!  e.g.,

		myNode N = new myNode();

	is totally unnecessary in your function.