Hash table: store the elements in a table with mod m

Hash function: the function to create the hash value(mod something)

The output of the hash function: Hash value

Hashing: The whole progress

Several data might mapped to the same key(Collision)

h: Hash table

m: The size of the

Good hash function: Avoid collision,

Solution of collision:

Not choosing m as a power of 2

Choose a prime number

Deal with String: convert to number

key[0] + 27key[1] + 27^2key[2]

Use linked list for the same key(separate chaining)

Open addressing

Linear probing