Other Approaches
	• Another approach is called quadratic probing. • This approach significantly reduces the clustering that happens with linear probing:   index + count2 • It is a more complicated hash function; it doesn't probe all locations in the table. – In fact, if you pick a hash table size that is a    power of 2, then there are actually very few positions that get probed  w/ many collisions.