1. Why is it important to assume that integers in our computer model have a ?xed size?
2. Consider the word puzzle problem on page 2. Suppose we ?x 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 described in Chapter?
b. Suppose the word list is presorted. Show how to use binary search to obtain an algorithm with signi?cantly better running time.