Binary Search

Summary

An O(log n) search technique for finding a target in sorted data by repeatedly halving the search space — deceptively easy to get subtly wrong at the boundaries.

How to Learn This

1Implement binary search from scratch without looking it up, including edge cases.
2Solve 'search in rotated sorted array' as a classic binary-search variant.
3Recognize binary-search-shaped problems: anything about a sorted (or monotonic) search space.

Graph

Recursion

More topics in Data Structures & Algorithms

Arrays Strings Linked List Stack Queue HashMap Heap Tree Graph Recursion Backtracking Sliding Window Greedy Dynamic Programming Sorting Searching

Stuck on this topic? Ask an Insider

Get 1:1 guidance from people who've walked this exact path — free on the InsideEdge app.

Download