Polynomial hash code in hashing is used to convert character strings to numerical
values. Use Horner’s rule to implement this algorithm, and also perform the character
conversion using ASCII format. Conduct experiments to study the collision rates for this
hash code by using different values (prime or non-prime numbers) for parameter a. Test
this polynomial hash code on English document not less than 15000 words.
What I just want to know, can anyone here tell me the "idea" how to implement this thing?
