How do I search a hash table?
问题 I've just started learning about hash tables and I understand how to insert but not how to search. These are the algorithms I'll be basing this question off: Hashing the key int Hash (int key) { return key % 10; //table has a max size of 10 } Linear probing for collision resolution. Suppose I call insert twice with the keys 1, 11, and 21. This would return slot 1 for all 3 keys. After collision resolution the table would have the values 1, 11, and 21 at slots 1, 2, and 3. This is what I