Home/Lessons/DSA/Binary Search — O(log n) on sorted data← All lessonsAdvanced·12 min·dsa · binary-search · interviewBinary Search — O(log n) on sorted dataLoading lesson…← PreviousHashing — the O(1) lookup that unlocks interviewsNext →Stacks — LIFO and the problems it solves