How do I write a hashcode to minimise collisions?

Question

I know the ideal hashcode algorithm is a research area, but what sensible things can I do to minimise collisions and why do they work?

For example, I've seen hashcode functions that make use of prime numbers, but I'm not clear on what the benefit is...

Just making sure: are you using a language where you *have to* do this on your own? — leoger, Sep 25 '10 at 13:28
Well yeah, I'm using Java - but I'm curious about the general idea, anyway — brabster, Sep 25 '10 at 13:30

score 1 · Accepted Answer · edited May 23 '17 at 11:47

1

This and this might help

edited May 23 '17 at 11:47

Community

answered Sep 25 '10 at 13:26

letronje

1 Answers1