Author: Ricardo Gibert
Date: 15:55:20 05/30/99
Go up one level in this thread
On May 30, 1999 at 15:53:43, Gregor Overney wrote: >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 Looks similar, but you are comparing apples and oranges, M is choosen to be a prime number in above to maximize distribution of keys, etc. Not the same M. The M I referred to is an M-bit key. Your confusion is typical stuff. Understandable given the funny similarity.
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.