Binary Search

Find elements or boundaries in sorted data in O(log n) time by repeatedly halving the search space. Also applies to "binary search on the answer space" for optimization problems.