CS2303 Tutorial Week 6 Notes:
Fast Memos for Hash:
In a hash table, the content stored is usually of the form (key, data). Therefore, when you are given a specific key k, you can find the corresponding key-based data in the table. Suppose the current slot you are checking contains (k’, data). If k=k’, then you already find the data you want, otherwise if k!=k’, then you go on to check the next possible slot according to the probing rules.
A number n is prime if for any integer m satisfying 1