🔎 Binary Search
USACO C++ Book · Interactive Visualizer
🔎 Binary Search — Find 11 in Sorted Array
Binary Search
O(log N)
Step 0/5
📊 Array [1,3,5,7,9,11,13,15,17,19], target=11
🗂 Data Structures
Search Range
Comparison Result
Iterations / Exclusions
Time:
O(log N)
Space:
O(1)
💻 Code
Hint
Click
Next Step ▶
to start and observe L/M/R pointer movement, halving the search space each step.
◀ Prev
Next Step ▶
↺ Reset
0/5
Keyboard:
→
Next
←
Prev
R
Reset