For reference:

2.3-5 Referring back to the searching problem (see Exercise 2.1-3), observe that if the eliminate half of the sequence from further consideration. The binary search al- gorithm repeats this procedure, halving the size of the remaining portion of the sequence each time. Write pseudocode, either iterative or recursive, for binary search. Argue that the worst-case running time of binary search is (lg n)