Suppose the dictionary is randomly ordered. Asymptotically (that is, in
terms of a likely Big-Oh running time), which of the following alterna
tives is the fastest if we assume that no words are longer than ten char
acters?

a. Sort the dictionary, and then use the algorithm in the text
b. Sort the dictionary, but then use interpolation search
c. Place the dictionary items in a binary search tree based map; the prefix test must be performed explicitly
d. Place the dictionary items in a hash table based map; the prefix test must be performed explicitly
e. Use a sequential search of the dictionary

D