Data Structures
	• We also should have noticed from the previous discussion that... – absolute ordered list are well suited for array implementations, since they are truly direct access abstractions – relative ordered list are rather poorly suited for arrays, since they require that data be shifted • therefore, hopefully the array consists of pointers to our data, so that at least when we shift we are only moving pointers rather than the actual data!!