MCQOPTIONS
Saved Bookmarks
| 1. |
If for an algorithm time complexity is given by O(log₂n) then complexity will be ___________ |
| A. | constant |
| B. | polynomial |
| C. | exponential |
| D. | none of the mentioned |
| Answer» E. | |