Binary Search
Binary search is an efficient searching algorithm for finding a specific value in a sorted array. It compares the target value to the middle element of the array and repeatedly narrows down the search until the value is found or the subarray becomes empty. It has a time complexity of O(log n).