Question: What is the time complexity of binary search in the best case scenario?

Options:

1. O(1)
2. O(log n)
3. O(n)
4. O(n log n)

Correct Answer: O(1)

Solution:

In the best case, the target element is found at the middle of the array, resulting in a time complexity of O(1).