More hash functions
Key = string
- Convert to integer
- S = a[0] a[1]…. a[n]
- r -- radix of character code (e.g. 128 or 256)
- K = a[0] + a[1]*r + …. + a[n]*r n
- Can be computed efficiently using Horner’s rule
- Make sure M doesn’t divide r k +/- a for any small a