
Binary search or half-interval search algorithm compares the
element to be search(i.e key) with the middle element of the array.
If the key is matched with the middle element ,it returns its
position.and if not it divides the array into sub array according to
the value of key.
If the key value is greater than the value of middle...