Current range
0–4
Guided conversation
The tutor does not just give the answer. It nudges, challenges weak elimination logic, and rewards the correct binary-search invariant.
Attempt 0 of 3
Search visualizer
Array: [1, 3, 5, 7, 9], target = 5. Watch the valid range shrink and see why binary search wins over linear scanning.
Stage: Setup
Start with a strategy. The goal is not to guess the answer; it is to eliminate half the search space each time.
A strong explanation should mention low, high, mid, and a comparison that preserves the sorted-array invariant.
Setup
Mid index
2
Elimination
0%
Mid probe
Found target
Eliminated region
Time complexity
O(n) — not efficient yet
Needs fixing
Optimized code
// Unlock the final implementation by explaining the true binary-search pattern.