MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the best case and worst case complexity of ordered linear search? |
| A. | O(nlogn), O(logn) |
| B. | O(logn), O(nlogn) |
| C. | O(n), O(1) |
| D. | O(1), O(n) |
| Answer» E. | |