ind - keep going until you find an empty cell (or get back)</p></li>
<li><p>problems</p>
<ul>
<li><p>cannot have a load factor &gt; 1, as you get close to 1, you get a lot of collisons</p></li>
<li><p>clustering - large blocks of occupied cells</p></li>
<li><p>‚Äúholes‚Äù when an element is removed
2.Quadratic:  f(i) = i^2</p></li>
</ul>
</li>
<li><p>hash(k)</p></li>
<li><p>hash(k)+1</p></li>
<li><p>hash(k)+4</p></li>
<li><p>hash(k)+9</p></li>
<li><p>you move out of clusters much quicker
3.Double ha