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