Folding method in hashing

August 4, 2013

basically folding method in hashing is a method in which we brake the key into pieces with modulus function(%) then add the broken parts of the key and generate an index for the hash table.If the index location generated by the folding method function is already filled then there is a collision.How to resolve collision

eg:
folding q

when we crop the number into pieces and add them we get the following output

folding a

#Uncategorized

Leave a Reply

Your email address will not be published. Required fields are marked *

*



eight − 6 =


You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>