Binary Search

Binary search is a search algorithm that finds the position of a target value within a sorted array. It works by repeatedly dividing the array in half and comparing the target value to the middle element of the array. If the target value is equal to the middle element, then the search is successful and the algorithm returns the index of the middle element. If the target value is less than the middle element, then the algorithm searches the lower half of the array. If the target value is greater than the middle element, then the algorithm searches the upper half of the array. This process continues until the target value is found or the entire array has been searched.