🔍 Binary Search Invariant

Divide and conquer to find the target

Searching for target: 42
Click "Next Step" to begin the search.
low pointer
high pointer
mid (checking)
Found!
📐 Loop Invariant: If the target exists in the array, it must be located within A[low...high].
✓ Invariant holds: Target could be anywhere in the full array.