c*********u
发帖数: 361 | 1 基本概念，不过问得比较细，觉得比较有参考价值。(这里语言用的是Java)
1. What is a hash table?
2. What does Java do when it creates a hash table?(details, size, load facto
r, etc)
3. How is the hash table implemented to ensure constant lookup time?
4. How is each element of the hash table implemented?
4. Say you have a hash table of size 10 and load factor of 0.5, what ha
ppens when you insert a 6th element? Why? | y**i
发帖数: 1112 | | c*********u
发帖数: 361 | 3 The hash table will double its size (this is my guess). A key point here is
that it has to allocate 20 new blocks of memory to ensure the constant
lookup property.
【在 y**i 的大作中提到】
: 最后一个问题怎么回答？
|
|
