What is the time complexity of binary search in a sorted array?*1 pointA. O(1)B. O(log n)C. O(n)D. O(n^2)

To determine the time complexity of binary search in a sorted array, we can analyze the steps involved in the algorithm.

1. Start by defining the lower and upper bounds of the search range, which initially correspond to the first and last elements of the array.

2. Calculate the middle index of the search range by taking the average of the lower and upper bounds.

3. Compare the value at the middle index with the target value we are searching for.

4. If the middle value is equal to the target value, the search is successful and we can return the index of the middle value.

5. If the middle value is greater than the target value, we update the upper bound to be the index before the middle index and repeat steps 2-4.

6. If the middle value is less than the target value, we update the lower bound to be the index after the middle index and repeat steps 2-4.

7. Repeat steps 2-6 until the target value is found or the search range becomes empty.

The time complexity of binary search can be determined by analyzing the number of iterations required to find the target value. At each iteration, the search range is halved, which means that the number of remaining elements to search is reduced by half.

Therefore, the time complexity of binary search in a sorted array is O(log n), where n is the number of elements in the array.

So, the correct answer is B. O(log n).