Binary search as the name suggest is a search technic of searching key value in a sorted arrangement by halving the entire sorted arrangement and comparing the found value with key value.If the key value is less than the found value, then left hand portion again to be halved and so on. Similarly if the key value is greater than the search value at first halving, then we have to again halv the right hand side of found value and so on.
in this we divide and find out the key value if exist.
so it is a divide and conquer algorithm.
