shing: i * hash2(k)</p></li>
<li><p>hash2 is another hash function - typically the fastest</p></li>
<li><p>problem where you loop over spots that are filled - hash2 yields a factor of the table size</p>
<ul>
<li><p>solve by making table size prime</p></li>
</ul>
</li>
<li><p>hash(k) + 1 * hash2(k)</p></li>
<li><p>hash(k) + 2 * hash2(k)</p></li>
<li><p>hash(k) + 3 * hash2(k)</p></li>
</ul>
</li>
</ul>
</li>
<li><p>a prime table size helps hash function be more evenly distributed</p></li>
<li><p>problem: when