Binary search is a search algorithm that finds the position of a target value in a sorted array. It eliminates the half in which the target value cannot lie. It searches the value in the other half. This continues by repeating the middle element to compare to the target value until the target value is found. 
Binary search is faster than linear search except for small arrays.