Editing Hash table (section)

=====Coalesced hashing=====
{{main| Coalesced hashing}}

[[Coalesced hashing]] is a hybrid of both separate chaining and open addressing in which the buckets or nodes link within the table.<ref name="chen87">{{cite book|publisher=[[Oxford University Press]]|year=1987|first1=Jeffery S.|last1=Vitter|first2=Wen-Chin|last2=Chen|isbn= 978-0-19-504182-8 |location=New York, United States|url=https://archive.org/details/designanalysisof0000vitt/ |url-access= registration|via=[[Archive.org]]|title= The design and analysis of coalesced hashing}}</ref>{{rp|pp=6–8}} The algorithm is ideally suited for [[Memory pool|fixed memory allocation]].{{r|chen87|p=4}} The collision in coalesced hashing is resolved by identifying the largest-indexed empty slot on the hash table, then the colliding value is inserted into that slot. The bucket is also linked to the inserted node's slot which contains its colliding hash address.{{r|chen87|p=8}}