The question is intended as a self-test for readers. Answers may be found in Appendix C.
The disadvantage of mergesort is that
a. it is not recursive.
b. it uses more memory.
c. although faster than the insertion sort, it is much slower than quicksort.
d. it is complicated to implement.
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.