Show that the number of compares used by mergesort is monotonically increasing (C(N+1) > C(N) for all N > 0).
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.