Consider an algorithm that makes about \log n levels of recursion, doing O(...

✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.

Consider an algorithm that makes about \log n levels of recursion, doing O(n) work in total at each level (this is merge sort). What is its overall time complexity?

O(2^n)

❌

O(n^2)

❌

O(n)

❌

O(\log n)

❌

O(n \log n)

✅

Want instant access to all verified answers on learning.monash.edu?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome