tom jerry
BAN USERSilicon Valley
Comments (4)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
I would like to use a balanced tree such as B+ Tree. The search time is O(tlogtn) and height of tree is very small (say the branching factor = 1000, then the depth is 2). It has less I/O operations since most of data needs to be stored on disk.
Another choice is hash table.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
hash table. string->bucket to find duplicate
- tom jerry April 22, 2008