rage time on unsuccessful find: Œª</p>
<ul>
<li><p>Average length of a list at hash(k)</p></li>
</ul>
</li>
<li><p>Average time on successful find: 1 + (Œª/2)</p>
<ul>
<li><p>One node, plus half the average length of a list (not including the item)</p></li>
</ul>
</li>
</ul>
</li>
<li><p>typical case will be constant time, but worst case is linear because everything hashes to same spot</p></li>
<li><p>Œª = 1</p>
<ul>
<li><p>Make hash table be the number of elements expected</p></li>
<li><p>So average 