Editing Hash table (section)

===Resizing by moving all entries===
Generally, a new hash table with a size double that of the original hash table gets [[dynamic memory allocation|allocated]] privately and every item in the original hash table gets moved to the newly allocated one by computing the hash values of the items followed by the insertion operation. Rehashing is simple, but computationally expensive.<ref>{{cite book |last1=Thareja |first1=Reema |title=Data Structures Using C |date=2014 |publisher=Oxford University Press |isbn=978-0-19-809930-7 |chapter=Hashing and Collision |pages=464–488 }}</ref>{{rp|pp=478–479}}