Wednesday, March 3, 2010
Hashing with linked chains
Hashing can use a linked list whenever there is a conflict for a key. Here a couple of questions:
1) how would you organize the list? sorted / unsorted?
2) would you need to allocate/disallocate in case of delete and insertion with collisions?
1) how would you organize the list? sorted / unsorted?
2) would you need to allocate/disallocate in case of delete and insertion with collisions?
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
[フレーム]