Take the 2-minute tour ×  I was going through Eric Lippert's
latest Blog post for Guidelines and rules for GetHashCode when i
hit this para:  We could be even more clever here; just as a
List resizes itself when it gets full, the bucket set could
resize itself as well, to ensure that the average bucket length
stays low. Also, for technical reasons it is often a good idea
to make the bucket set length a prime number, rather than 100.
There are plenty of improvements we could make to this hash
table. But this quick sketch of a naive implementation of a hash
table will do for now. I want to keep it simple.  So looks like
i'm missing something. Why is it a good practice to set it to a
prime number?.  share|improve this question Why write your own
when there are better, tested, and fast implementations built
into the .Net framework? Check under System.Collections. –  Will
Mar 1 '11 at 8:36 @Will i am not writing my own.. and moreover
Eric is just giving an example there... –  Shekhar_Pro Mar 1 '11
at 8:40 add comm