<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Coalesced hashing - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Coalesced_hashing&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Coalesced_hashing&amp;p=3">3.Next</a>
</p>
<p>in a great deal of wasted memory because the table itself must be large enough to maintain a load factor that performs well (typically twice the expected number of items), and extra memory must be used for all but the first item in a chain (unless list headers are used, in which case extra memory must be used for all items in a chain).</p>

<p><big> Example </big></p>
<p>Given a sequence "qrj," "aty," "qur," "dim," "ofu," "gcl," "rhv," "clq," "ecd," "qsu" of randomly generated three character long strings, the following table would be generated (using</p><p>
<a accesskey="1" href="page.php?w=Coalesced_hashing&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Coalesced_hashing&amp;p=3">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
