Question: If an array-based List is sorted, what is the Big-Oh for Search: A. O(log n) B. O(n) C. O(n2) D. O(1)
If an array-based List is sorted, what is the Big-Oh for Search:
| A. | O(log n) | |
| B. | O(n) | |
| C. | O(n2) | |
| D. | O(1) |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
