Binary Search is used in many applications like and spell checkers.

The number of iterations in Binary Search is at most

Binary Search is an example of a algorithm.

Binary Search is a search algorithm.

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

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

In Binary Search, search interval is repeatedly in half.