MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the time complexity of Fibonacci Search? |
| A. | O(logn) |
| B. | O(n) |
| C. | O(n<sup>2</sup>) |
| D. | O(nlogn) |
| Answer» C. O(n<sup>2</sup>) | |