Hash Functions. Commonly used method h(k) = k mod M,, Why we choose value of M to be prime no.

Posted by RBA on Stack Overflow See other posts from Stack Overflow or by RBA
Published on 2010-05-07T12:41:35Z Indexed on 2010/05/07 12:48 UTC
Read the original article Hit count: 168

Filed under:
|

Hi,

Please share the reason why in Hash Functions, the common method i.e. h(k) = k mod M... Why we choose the value of M to be always prime no.

Thanks..

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about hashing