roperty!</p></li>
<li><p>Thus, no findMin or findMax</p></li>
<li><p>Hash tables store key-value pairs</p></li>
<li><p>Each value has a specific key associated with it</p></li>
</ul>
</li>
<li><p>fixed size array of some size, usually a prime number</p></li>
<li><p>A hash function takes in a ‚Äúthing‚Äù (string, int, object, etc.)</p>
<ul class="simple">
<li><p>returns hash value - an unsigned integer value which is then mod‚Äôed by the size of the hash table to yield a spot within the bounds of