Linear Probing
	• With this scheme, – we search the hash table sequentially, starting at the original hash location... – Typically we WRAP AROUND from the last table location to the first table location if we have trouble finding a spot. – Notice what this approach does to retrieving and deleting items. We may have to make a number of comparisons before being able to determine where an item is located...or to determine if an item is NOT in the table.