Vidyalelo
Data Structure · Q519

Miscellaneous on Data Structures

Programming · Data Structure · question 519

Q519

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
Answer
D.
T(n) = O(n2)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board