Algorithm Efficiency
	• Notice that as the size of the list grows, – the unsorted array and pointer base implementation might require more time to retrieve the desired node (it definitely would in the worst case situation...because the node is farther away from the beginning of the list). – In contrast, regardless of how large the list is, the hash table implementation will always require the same constant amount of time.