Algorithm for Finding an Object x in a Hash Table

1. Get the index h into the hash table
   • Compute the hash code
   • Reduce it modulo the table size
2. Iterate through the elements of the bucket at position h
   • For each element of the bucket, check whether it is equal to x
3. If a match is found among the elements of that bucket, then x is in the set
   • Otherwise, x is not in the set