O'Reilly logo
  • Alberto Villarreal thinks this is interesting:

Thus, it is important that the preprocessing, hashing, and collision algorithms of a hashed data structure be carefully chosen in order to minimize the number of collisions. Before studying three specific algorithms and the features that minimize collisions, we will examine the strategy used to size the primary storage area array for a hashed structure because the size of this array can also have an effect on the number of times the collision algorithm executes. This discussion will begin with a d

From

Cover of Data Structures and Algorithms Using Java

Note

THURSDAY cont