Interesting problem : How can we apply binary search to search a string in a big word file?
We use a
suffix array and sort this array. Once sorted, we apply binary search on this array. See Bentley
Programming Pearls p.172. See also :
Large-scale genome sequence processing By Masahiro Kasahara, Shinichi Morishita,
p.56
We can optimize this even further by storing the radix representation of strings (see:Cormen's section in Hashing) and the problem will be reduced to binary search of numbers.