
Lesson 13A-5: Case Study Maintenance
Recursion | 319
Name __________________________________________ Date _______________________
Section _________________________________________
Exercise 1: An alternative way of implementing a binary search algorithm is to make the function
an int function. If the item is not found, a negative number is returned; otherwise, the index of
the position where the item resides is returned. Implement a binary search algorithm using his
scheme.
Exercise 2: Take your function from Exercise 1 and substitute it in program BinSearch. Of
course, you will have to make some changes in BinSearch so that it will be compatible with ...