probes that are required to find free location and lesser is the performance this phenomenon is called primary clustering to avoid primary clusteringother techniques such as quadratic probing and double hashing are used quadratic probing in this techniqueif value is already stored at location generated by ( )then the following hash function is used to resolve the collisionh(ki[hc/(kc mod where is the size of the hash tablehc/( ( mod ) is the probe number that varies from to - and and are constants such that and quadratic probing eliminates the primary clustering phenomenon of linear probing because instead of doing linear searchit does quadratic search for given key kfirst the location generated by hc/(kmod is probed if the location is freethe value is stored in itelse subsequent locations probed are offset by factors that depend in quadratic manner on the probe number although quadratic probing performs better than linear probingin order to maximize the utilization of the hash tablethe values of and need to be constrained example consider hash table of size using quadratic probinginsert the keys and into the table take and solution let hc/(kk mod mm initiallythe hash table can be given as - - - - - - - - - - we haveh(ki[hc/(kc mod step key ( [ mod mod [ mod mod mod = since [ is vacantinsert the key in [ the hash table now becomes - - - - - - - - - step key ( [ mod mod [ mod mod mod = since [ is vacantinsert the key in [ the hash table now becomes - - - - - - - -