Editing Hash table (section)

=====Cuckoo hashing=====
{{main|Cuckoo hashing}}

[[Cuckoo hashing]] is a form of open addressing collision resolution technique which guarantees <math>O(1)</math> worst-case lookup complexity and constant amortized time for insertions. The collision is resolved through maintaining two hash tables, each having its own hashing function, and collided slot gets replaced with the given item, and the preoccupied element of the slot gets displaced into the other hash table. The process continues until every key has its own spot in the empty buckets of the tables; if the procedure enters into [[infinite loop]]—which is identified through maintaining a threshold loop counter—both hash tables get rehashed with newer hash functions and the procedure continues.<ref>{{Cite book | last1 = Pagh | first1 = Rasmus | author1-link = Rasmus Pagh | last2 = Rodler | first2 = Flemming Friche| chapter = Cuckoo Hashing | doi = 10.1007/3-540-44676-1_10 | title = Algorithms — ESA 2001 | series = Lecture Notes in Computer Science | volume = 2161| pages = 121–133 | year = 2001 | isbn = 978-3-540-42493-2 | citeseerx = 10.1.1.25.4189}}</ref>{{rp|pp=124–125}}