Yes, there seems to be stuff missing, but what?
I think I kinda moved it to the alinea before... I guess I intended something like this:
So, how does this hash function work? Usually it takes the word as a number, then does a bitshift or 2 and then takes the remainder after division by a prime number (preferrably close to the size of the hash table). You should realize that if the hash function always returns the same number, or a very limited set of numbers for all keys, performance goes down the drain and you end up with a really bulky implementation of an unordered list you have to search through one by one...
