On Fri, Nov 30, 2001 at 09:07:43AM +1100, Sam Holden wrote: > > In practice hashes are O(1), in theory they are O(n) or O(log N) if you are > mad and hang a binary tree off the buckets...
If you're mad, you use double hashing with binary probing. ;-) No secondary lists, colisions are resolved by using a secondary hash function. Abigail
