Question: Need help Please What is the time complexity of binary search algorithm when there are n items in the array? Assume that the array is
Need help Please
What is the time complexity of binary search algorithm when there are n items in the array? Assume that the array is already sorted.
| A) | O(n) |
| B) | O(log n) |
| C) | O(n^2) |
| D) | O(n * log n) |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
