Collision Resolution
	• As an alternative, we need to understand how to implement schemes to resolve collisions. • Otherwise, hashing isn't a viable searching algorithm. • When developing a hash functions: – try to develop a function that is simple & fast – make sure that the function places items evenly throughout the hash table without wasting excess memory –  make the hash table large enough to be able to accomplish this.