[tedman]

Another interview question.

which data structure would you use to program a library, so that books can be found very fast???

[friendsforniraj]

i will suggest tree

[shabbir]

Quote:

Originally Posted by friendsforniraj

i will suggest tree

Hashing.

[tedman]

actually the interviewer said that it shudnt be an order n solution, that is the book should be found in the first try itself!

[shabbir]

Quote:

Originally Posted by tedman

actually the interviewer said that it shudnt be an order n solution, that is the book should be found in the first try itself!

Hashing if first try. and any array if order of n.