Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
For n a power of 2, mergesort is linearithmic because:
It halves the array once and then does linear work
There are about lg n levels of recursion and merging does about n work per level, giving about n lg n
It makes n recursive calls, each doing constant work
Each merge is quadratic, but there are only lg n merges
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!