Binary Search

Intuition

Binary search is an efficient array search algorithm. It works by narrowing down the search range by half each time. If you have looked up a word in a physical dictionary, you've already used binary search in real life. Let's look at a simple example:

Given a sorted array of integers and an integer called target, find the element that equals the target and return its index. If the element is not found, return -1.

The key observation here is that the array is sorted. We pick a random element in the array and compare it to the target.

  • If we happen to pick the element that equals the target (how lucky!), then bingo. We don't need to do any more work; return its index.
  • If the element is smaller than the target, then we know the target cannot be found in the section to the left of the current element since everything to the left is even smaller. So we discard the current element and everything on the left from the search range.
  • If the element is larger than the target, then we know the target cannot be found in the section to the right of the current element since everything to the right is even larger. So we discard the current element and everything on the right from the search range.

We repeat this process until we find the target. Instead of picking a random element, we always pick the middle element in the current search range. This way, we can discard half of the options and shrink the search range by half each time. This gives us O(log(N)) runtime.

Try it yourself

Implementation

The search range is represented by the left and right indices that start from both ends of the array and move towards each other as we search. When moving the index, we discard elements and shrink the search range.

Time Complexity: O(log(n))

First slide
First slide
First slide
First slide
First slide
First slide
First slide
First slide
PreviousNext
1from typing import List
2
3def binary_search(arr: List[int], target: int) -> int:
4    left, right = 0, len(arr) - 1
5    while left <= right:  # <= because left and right could point to the same element, < would miss it
6        mid = (left + right) // 2 # double slash for integer division in python 3, we don't have to worry about integer `left + right` overflow since python integers can be arbitrarily large
7        # found target, return its index
8        if arr[mid] == target:
9            return mid
10        # middle less than target, discard left half by making left search boundary `mid + 1`
11        if arr[mid] < target:
12            left = mid + 1
13        # middle greater than target, discard right half by making right search boundary `mid - 1`
14        else:
15            right = mid - 1
16    return -1 # if we get here we didn't hit above return so we didn't find target
17
18if __name__ == '__main__':
19    arr = [int(x) for x in input().split()]
20    target = int(input())
21    res = binary_search(arr, target)
22    print(res)
23

Calculating mid

Note that when calculating mid, if the number of elements is even, there are two elements in the middle. We usually follow the convention of picking the first one, equivalent to doing integer division (left + right) / 2.

In most programming languages, we calculate mid with left + floor((right-left) / 2) to avoid potential integer overflow. However, in Python, we do not need to worry about left + right integer overflow because Python3 integers can be arbitrarily large.

Deducing binary search

It's essential to understand and deduce the algorithm yourself instead of memorizing it. In an actual interview, interviewers may ask you additional questions to test your understanding, so simply memorizing the algorithm may not be enough to convince the interviewer.

Key elements in writing a correct binary search:

1. When to terminate the loop

Make sure the while loop has an equality comparison. Otherwise, we'd skip the loop and miss the potential match for the edge case of a one-element array.

2. Whether/how to update left and right boundary in the if conditions

Consider which side to discard. If arr[mid] is already smaller than the target, we should discard everything on the left by making left = mid + 1.

3. Should I discard the current element?

For vanilla binary search, we can discard it since it can't be the final answer if it is not equal to the target. There might be situations where you would want to think twice before discarding the current element. We'll discuss this in the next module.

When to use binary search

Interestingly, binary search works beyond sorted arrays. You can use binary search whenever you make a binary decision to shrink the search range. We will see this in the following modules.

P.S. Did you notice AlgoMonster's logo is an illustration of binary search? :P