Binary search is a search algorithm that finds the position of a target value within a sorted array.

The above illustration shows the working of the binary search algorithm on a sorted array when the target value is 4.

Binary search works on sorted arrays. A binary search begins by comparing the middle element of the array with the target value. If the target value matches the middle element, its position in the array is returned. If the target value is less or more than the middle element, the search continues the lower or upper half of the array respectively with a new middle element, eliminating the other half from consideration.

The pseudocode for binary search algorithm is as follows:

BinarySearch(A[0..N-1], value) {
  low = 0
  high = N - 1
  while (low <= high) {
    // invariants: value > A[i] for all i < low
                   value < A[i] for all i > high
    mid = (low + high) / 2
    if (A[mid] > value)
      high = mid - 1
    else if (A[mid] < value)
      low = mid + 1
    else
      return mid
  }
  return not_found // value would be inserted at index "low"
}

• Worst case performance: O(log n)
• Best case performance: O(1)
• Average case performance: O(log n)
• Worst case space complexity: O(1) for iterative; O(log n) for recursive.

int binarySearch(int arr[], int value, int left, int right) {
  int middle;
  while (left <= right) {
    middle = (left + right) / 2;
    if (arr[middle] == value)
      return middle;
    else if (arr[middle] > value)
      right = middle - 1;
    else
      left = middle + 1;
  }
  return -1;
}

🚀 Run Code

def binary_search(l, value):
    low = 0
    high = len(l)-1
    while low <= high:
        mid = (low+high)//2
        if l[mid] > value: high = mid-1
        elif l[mid] < value: low = mid+1
        else: return mid
    return -1

🚀 Run Code