Author: Gregor Overney
Date: 12:53:43 05/30/99
Go up one level in this thread
On May 29, 1999 at 22:29:15, Ricardo Gibert wrote:
>Just think about what you are saying. "M mod N" would then be hashing a
>function according to you.
p. 515, "6.4 Hashing", D. E. Knuth, The Art of Computer Programming, Vol. 3,
Addison-Wesley Longman, 1998.
"The divsion method is particularly easy; we simple use the remainder module M:
h(K) = K mod M."
What's the problem with Bob's "way of defining hashing"?
Gregor
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.