a Read the words.txt file from problem 1 into an array so that each word is stored in the array (it can be a 2D array of
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
a Read the words.txt file from problem 1 into an array so that each word is stored in the array (it can be a 2D array of
a Read the words.txt file from problem 1 into an array so that each word is stored in the array (it can be a 2D array of char). Then, implement the recursive binary search algorithm (it is given in 10.3 and a version using an array of ints is in the lecture notes) so that the program allows you to input a word and then outputs whether or not the entered word is in the word list by using the binary searcch algorithm. The recursive algorithm should not use any global variables.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!