Binary Search can be used to find the closest value to a target value in a array.

Binary Search only works on data.

Binary Search is an example of a algorithm.

The number of iterations in Binary Search is at most

A binary search algorithm is an algorithm that finds the position of a target value within a sorted list.

In Binary Search, if the middle element matches the target value, the search is .