What is the time complexity of Binary Search in the worst case?

The worst-case time complexity of Binary Search is O(log n). Here's why:

1. Binary Search is an algorithm that divides the search space in half each time it runs. This is because it starts in the middle of a sorted list, and determines whether the target value is in the first half or the second half of the list.

2. If the target value is in the first half, it repeats the process on that half. If the target value is in the second half, it repeats the process on that half. This continues until the target value is found or until there are no more values to search.

3. Because the search space is divided in half each time, the time it takes to run the algorithm is a logarithmic function of the size of the list. This is why we say the time complexity is O(log n), where n is the size of the list.

4. In the worst-case scenario, the target value is not in the list, and the algorithm has to run through all its steps until it has searched the entire list. This still results in a time complexity of O(log n), because the search space is still divided in half each time.