| 
|
Quote: a shifted sum works well for hashing but the modulus needs careful selection; primes aren't best
topics >
all references >
references m-o >
Topic:
hash table and hash functions
Quotation Skeleton
It seems to be the case that [hash] algorithms of the style h_0 = 0; h_i = k … and N need to be selected with care. … The experiments have shown that very small variations … popular view, that choice of a prime number … [Recommends k=4 and N odd or selected from their results]. Google-1 Google-2
Copyright clearance needed for quotation.
Additional Titles
Quote: for hashing, use double shifted sum modulo an odd number; or select number by testing
Topic: hash table and hash functions (41 items)