Skip to main content

🎮 Binary Search (Practice)

Companion to the Binary Search guide. See the search space halve each step, then write the classic loop.

🎬 Watch it work​

Binary Search — halving the search spaceStep 1 / 5
lo▼
1
3
5
7
9
11
13
hi▼
15
Search for 11 in a sorted array — O(log n).

🐍 Your turn​

Loading editor…

🧠 Challenge yourself​

  1. Return the insertion point for a missing target (where it would go).
  2. Implement lower_bound (first index with a[i] >= target).
  3. Why is mid = lo + (hi-lo)//2 sometimes preferred over (lo+hi)//2?

Continue the path → Sorting Algorithms