Binary Search

Binary Search is a searching algorithm techniques for finding an element position in a sorted array. While performing a binary search, if the array elements are not sorted already, we need to sort them first. In binary search, the element is always searched in the middle of a portion of an array. It can be implemented in two ways-