Implement binary search that returns an index or -1 in a sorted ascending array. What are its assumptions?
Maintain a search interval and discard the half that cannot contain the target after each comparison. The input must be sorted according to the same comparison rule used by the search. The example ret...