What is the result of the recurrences which fall under the extended second case of Master's theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc(log n)k?
A. T(n) = O(nlogba)
B. T(n) = O(nc log n)
C. T(n)= O(nc (log n)k+1
D. T(n) = O(n2)
Answer: Option C
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Join The Discussion