"In computer science, binary search, also known as half-interval search" because it breaks sorted array into 2 halfs, half where target value cannot present eliminates from search, and remained half is brokes in 1 parts again, until there will not be part with target result. Advantage of binary search, that it faster than linear search, but disadvantage is that the binary search can be used on sorted array.