Searching visualizer

Binary Search

Find a target efficiently inside a sorted array.

Best O(1)Average O(log n)Worst O(log n)Space O(1)
Example Array
[3, 7, 12, 18, 25, 31, 44, 57, 63]

Visualization

Ready
Ready to find 25 in the sorted array.Target: 25
CurrentVisitedDiscardedFound

Metrics

Comparisons0
Steps0
Progress0%
Time taken0.0s

Pseudocode

  1. binarySearch(arr, target)
  2. low = 0, high = n - 1
  3. while low <= high
  4. mid = floor((low + high) / 2)
  5. compare arr[mid] with target
  6. if arr[mid] == target: return mid
  7. if arr[mid] < target
  8. low = mid + 1
  9. else
  10. high = mid - 1
  11. return -1