|
|
|
|
|
by jfoutz
4206 days ago
|
|
Instead of a linked list to store hash collisions, it's using linear probing, which just uses the next open spot in the table. (Maybe I'm misunderstanding the question, it looks like they're indexing into the table correctly to me) |
|