Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Compared with insertion sort, mergesort (as in merge.py) needs:
No comparisons, only merges
Extra memory proportional to n for an auxiliary array
Less memory, because it sorts in place
The input to be already partly sorted
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!