The binary search algorithm developed in Chapter 11 uses two variables to track the endpoints of each sublist. These end points can become arguments to a recursive binary search function. Write a program that implements the binary search of a sorted list using recursion. The program should include definitions of a top-level function that hides the end points of the sublist and a helper function that uses them in recursive calls.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here