<p>If the returned number is less than zero, the first node should be before the second. If it is greater
than zero the second node should be before the first. If it is zero the order of the nodes doesn't matter.</p>
<p>This merge sort implementation creates and uses a single Vector during the sort operation.</p>
Performs a merge sort on the node list. In general, merge sort is more efficient than insertion sort with long lists that are very unsorted.
<p>The sort function takes two nodes and returns a Number.</p>
<p><code>function sortFunction( node1 : MockNode, node2 : MockNode ) : Number</code></p>
<p>If the returned number is less than zero, the first node should be before the second. If it is greater than zero the second node should be before the first. If it is zero the order of the nodes doesn't matter.</p>
<p>This merge sort implementation creates and uses a single Vector during the sort operation.</p>