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

Binary Search can be implemented both iteratively and .

In Binary Search, search interval is repeatedly in half.

The number of iterations in Binary Search is at most

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

Binary Search only works on data.