Question

Which case of master’s theorem can be extended further?

(a) 1

(b) 2

(c) 3

(d) No case can be extended

I have been asked this question in an online interview.

I'm obligated to ask this question of Masters theorem in chapter Recursion of Data Structures & Algorithms II

Answer 1

Right answer is (b) 2

To explain: The second case of master’s theorem can be extended for a case where f(n) = n^c (log n)^k and the resulting recurrence becomes T(n)= O(n^c (log n))^k+1.