Editing Hash table (section)

==== Load factor for open addressing ====

With open addressing, each slot of the bucket array holds exactly one item. Therefore an open-addressed hash table cannot have a load factor greater than 1.<ref name="plank" >
James S. Plank and Brad Vander Zanden.
[http://web.eecs.utk.edu/~bvanderz/teaching/cs140Sp15/Notes/Hashing/ "CS140 Lecture notes -- Hashing"].
</ref>

The performance of open addressing becomes very bad when the load factor approaches 1.<ref name="cornell08" />

Therefore a hash table that uses open addressing ''must'' be resized or ''rehashed'' if the load factor <math>\alpha</math> approaches 1.<ref name="cornell08" />

With open addressing, acceptable figures of max load factor <math>\alpha_{\max}</math> should range around 0.6 to 0.75.<ref>{{cite journal |last1=Maurer |first1=W. D. |last2=Lewis |first2=T. G. |title=Hash Table Methods |journal=ACM Computing Surveys |date=March 1975 |volume=7 |issue=1 |pages=5–19 |doi=10.1145/356643.356645 |s2cid=17874775 }}</ref>{{r|owo03|p=110}}