Suppose that you remove the call to merge from the mergesort algorithm to obtain
+mystery(inout theArray:ItemArray,
in first:integer, in last:integer)
//mystery algorithm for theArray[first..last].
if(first < last) {
mid = (first + last) / 2
mystery(theArray, first, mid)
mystery(theArray, mid+1, last)
} // end if
What does this new algorithm do?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.