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