A Good Hash Function…
is easy (fast) to compute (O(1) and practically fast).
distributes the data evenly (hash(a) % size ? hash(b) % size).
uses the whole hash table (for all 0 ? k < size, there’s an i such that hash(i) % size = k).
Previous slide
Next slide
Back to first slide
View graphic version