figure cluster of items for slot figure collision resolution using "plus disadvantage to linear probing is the tendency for clusteringitems become clustered in the table this means that if many collisions occur at the same hash valuea number of surrounding slots will be filled by the linear probing resolution this will have an impact on other items that are being insertedas we saw when we tried to add the item above cluster of values hashing to had to be skipped to finally find an open position this cluster is shown in figure one way to deal with clustering is to extend the linear probing technique so that instead of looking sequentially for the next open slotwe skip slotsthereby more evenly distributing the items that have caused collisions this will potentially reduce the clustering that occurs figure shows the items when collision resolution is done with "plus probe this means that once collision occurswe will look at every third slot until we find one that is empty the general name for this process of looking for another slot after collision is rehashing with simple linear probingthe rehash function is new_hash_value rehash(old_hash_valuewhere rehash(pos(pos )%size_of_table the "plus rehash can be defined as rehash(pos(pos )%size_of_table in generalrehash(pos(pos skip)%sizeoftable it is important to note that the size of the "skipmust be such that all the slots in the table will eventually be visited otherwisepart of the table will be unused to ensure thisit is often suggested that the table size be prime number this is the reason we have been using in our examples variation of the linear probing idea is called quadratic probing instead of using constant "skipvaluewe use rehash function that increments the hash value by and so on sorting and searching