Flowchart of the Binary Lookup Algorithm

Binary Lookup, also known as Binary Search, is an efficient algorithm used to find the position of a target value within a sorted array. It works by repeatedly dividing the search interval in half. If the target value is equal to the middle element, the search is successful. If the target value is smaller or larger than the middle element, the search continues on the left or right half, respectively.