data structures using [ ( )mod ( mod mod = now [ is occupiedso we cannot store the key in [ thereforetry again for the next location thus probei this time key ( [ mod ( mod )mod [ ( )mod [ mod mod = since [ is vacantinsert the key in [ the hash table now becomes - - - step key ( [ mod ( mod )mod [ ( )mod mod = now [ is occupiedso we cannot store the key in [ thereforetry again for the next location thus probei this time key ( [ mod ( mod )mod [ ( )mod [ mod = now [ is occupiedso we cannot store the key in [ thereforetry again for the next location with probe repeat the entire process until vacant location is found you will see that we have to probe many times to insert the key in the hash table although double hashing is very efficient algorithmit always requires to be prime number in our case = which is not prime numberhencethe degradation in performance had been equal to the algorithm would have worked very efficiently thuswe can say that the performance of the technique is sensitive to the value of rehashing when the hash table becomes nearly fullthe number of collisions increasesthereby degrading the performance of insertion and search operations in such casesa better option is to create new hash table with size double of the original hash table all the entries in the original hash table will then have to be moved to the new hash table this is done by taking each entrycomputing its new hash valueand then inserting it in the new hash table though rehashing seems to be simple processit is quite expensive and must therefore not be done frequently consider the hash table of size given below the hash function used is (xx rehash the entries into to new hash table