Binary Search

Binary Search is a classic divide-and-conquer algorithm that finds the position of a target value within a sorted array.

Step 1 / 0

Dataset Configuration

Sorted Array (comma separated)

Target Value

State Variables

lo0

hi0

mid-

Search Space1 elements

Algorithm Logic

Pseudocode

1function binarySearch(A, target):
2  lo = 0, hi = length(A) - 1
3  while lo <= hi:
4    mid = floor((lo + hi) / 2)
5    if A[mid] == target:
6      return mid
7    else if A[mid] < target:
8      lo = mid + 1
9    else:
10      hi = mid - 1
11  return -1