

MCQOPTIONS
Saved Bookmarks
1. |
Solve the following recurrence using Master s theorem.T(n) = 2T (n/2) + n/ log n |
A. | T(n) = O(n) |
B. | T(n) = O(log n) |
C. | T(n) = O(n<sup>2</sup>log n) |
D. | cannot be solved using master s theorem |
Answer» E. | |