C++
The binary search algorithm given in this chapter is nonrecursive. Write and implement a recursive version of the binary search algorithm.
The program should prompt Y / y to continue searching and N / n to discontinue. If an item is found in the list display the following message:
x found at position y
else:
x is not in the list
Use the following list of integers when testing your program:2, 6, 8, 13, 25, 33, 39, 42, 53, 58, 61, 68, 71, 84, 97
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here