Data Structures for Tables
•We will look at both array based and pointer based implementations of the ADT Table.
•When we say linear, we mean that our items appear one after another...like a list.
•We can either organize the data in sorted order or not.
•If your application frequently needs a key accessed in sorted order, then they should be stored that way. But, if you access the information in a variety of ways, sorting may not help!