1.

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

A. T(n) = O(n (log n)<sup>2</sup>)
B. T(n) = O(n log n)
C. T(n) = O(n<sup>2</sup>log n)
D. cannot be solved using master s theorem
Answer» B. T(n) = O(n log n)


Discussion

No Comment Found