# Chain Hashing

This is a form of Hash table ($A$, $h: K \rightarrow A$) who’s entries in the associative array are linked lists . Given an element $k \in K$ to add it to this hash table you calculate $h(k)$ then append it to the associated linked list . Then to check if an element $e \in K$ is in your hash table calculate $h(e)$ and then search the associated linked list.