Vidyalelo
Data Structure · Q175

Miscellaneous on Data Structures

Programming · Data Structure · question 175

Q175

Solve the following recurrence using Master's theorem. T(n) = 16T (n/4) + n

A.
T(n) = O(n)
B.
T(n) = O(log n)
C.
T(n) = O(n2log n)
D.
T(n) = O(n2)
Answer

Answer: Option D

Solution

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