Essential things to remember from today's class (class 3, 28th August)

How to resolve hash value clashes - "buckets" are linked lists

Always use pointers, don't embed objects - duplicated data, failed updates.

Hash tables are all about speed so do everything as efficiently as possible.

The Poisson distribution and why it is important for hash tables.

What kinds of mistakes can lead to bad hash function.

How to keep the size of a hash table within reasonable limits.

Why vectors and hash tables grow by multiplication instead of incrementation.