Free preview
Linear & Binary Search
O(n) linear scan works on anything; O(log n) binary search needs sorted data and gives deterministic worst-case timing, plus the overflow and off-by-one bugs that haunt it.
20 min read
This lesson is part of Pro
Upgrade to unlock the full lesson, every coding problem, and the complete interview Q&A.
Unlock with ProThis is just the start
Sign up free to track progress on this lesson, get coding problems with the Run button, and unlock the full interview Q&A.