Consider the word puzzle problem described in Chapter 1. Suppose we fix the size of the longest word to be 10 characters.
a. In terms of R and C, which are the number of rows and columns in the puzzle, and W, which is the number of words, what are the running times of the algorithms?
b. Suppose the word list is presorted. Show how to use binary search to obtain an algorithm with significantly better running time.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.