Binary Search Simulation

Explore shrinking intervals: the active range, midpoint selection, and directional decisions until target is found or interval collapses.

Size

1/4

Foundmidactive rangeinactive

Current Interval

mid

lo=0 hi=9 mid=4 target=94

Step Detail

Middle value less than target → shift lo right.

Pseudocode

1function binarySearch(arr, target):
2  lo = 0; hi = length(arr) - 1
3  while lo <= hi:
4    mid = (lo + hi) // 2
5    if arr[mid] == target: return mid
6    if arr[mid] < target: lo = mid + 1 else hi = mid - 1
7  return -1

Mechanics

Each decision halves the interval, guaranteeing logarithmic steps. Visualization emphasizes interval contraction, mid repositioning, and termination condition.

Quick Sort View Theory Maximum Subarray (D&C)