Binary search is a classic algorithm for finding an element in a sorted array in logarithmic time. It is widely used in competitive programming for search and optimization problems.
