Data Structures for Tables
	• With an unsorted table, we can save information at the end of the list or at the beginning of the list; • therefore, insert is simple to implement: for both array and pointer-based implementations. • For an unsorted table, it will take the same amount of time to insert an item regardless of how many items you have in your table.