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

assembly - 8086 TASM: Illegal Indexing Mode -

Java, LWJGL, OpenGL 1.1, decoding BufferedImage to Bytebuffer and binding to OpenGL across classes -

java - SmsManager sending message more than one -