i have a question about hash tables in c++. as far as i can see i can create the hash table via hash_map or using a vector. now i don't understand what is the difference and what would be a better( ==faster(construction time , retrieval time),memory efficient ) way for the following case:
all values are integers!Code:Key Value 12 32 13 56 3 54 1 54 76 54 ...
now the table is expected to be large containing between 10 and several hundred million records.