Binary search explained:

Binary search is one of the highly efficient search algorithm with a complexity of log(n) as here we divide the target array to half n/2 each time till we get the target item , so for an array of size 8 . we get the element with in 3 operation.

Note that binary search can be carried out only for a sorted array so it wont be always the best algorithm to use.