Section Recap

Summary

Binary Search achieves O(logn)O(\log n) by halving the search space with each comparison. The pattern clicks when you recognize monotonic properties: once something becomes true (or false), it stays that way.

You'll reach for this whenever you see "sorted" or "find minimum/maximum satisfying condition." If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.