c - Data structure with constant time search and unique indices -


i want construct data structure when given 80-bit key (unsigned char), should store key , corresponding value @ unique index (dense indexing) since index 32-bit size not 80-bit. , should provide constant-time (worst case) search functionality.

if correct hash table open addressing collision mechanism can achieve this, right? and/or there other better data structure achieve these objectives?

note: 80-bit key of type unsigned char since i'm working in c.


Comments

Popular posts from this blog

c# - Send Image in Json : 400 Bad request -

javascript - addthis share facebook and google+ url -

ios - Show keyboard with UITextField in the input accessory view -