efficiently search for an input word in an unbounded dictionary.
Respostas da entrevista
Sigiloso
19 de abr. de 2011
To reply to the above, by "unbounded" here it is probably meant "very large, and with unknown size". As such, it can be sorted. First poster is correct.
Sigiloso
24 de jun. de 2012
if it is unbounded and size is really large, B+ tree would be a good choice
Sigiloso
22 de out. de 2010
In an unbounded dictionary, words probably are not sorted.