#
Problem
Difficulty
Status
Binary search is a divide-and-conquer algorithm that efficiently finds a target value by repeatedly halving the search space. It requires a sorted array or a monotonic decision function, achieving O(log n) time complexity.