Editing Hash function (section)

=== Division hashing ===
A standard technique is to use a modulo function on the key, by selecting a divisor {{Mvar|M}} which is a prime number close to the table size, so {{Math|''h''(''K'') &equiv; ''K'' (mod ''M'')}}. The table size is usually a power of 2.  This gives a distribution from {{Math|{{mset|0, ''M'' &minus; 1}}}}.  This gives good results over a large number of key sets.  A significant drawback of division hashing is that division requires multiple cycles on most modern architectures (including [[x86]]) and can be 10 times slower than multiplication. A second drawback is that it will not break up clustered keys. For example, the keys 123000, 456000, 789000, etc. modulo 1000 all map to the same address.  This technique works well in practice because many key sets are sufficiently random already, and the probability that a key set will be cyclical by a large prime number is small.