In this chapter we will be concerned with non-primitive data structures that are linear. A number of possible storage representations for these linear structures are available. We will concentrate here on array structures only. Others will be discussed in the succeeding chapters.
3.1 LINEAR ARRAYS
An array is an ordered set that consists of a fixed number of identical type of objects. No deletion or addition operations are performed on arrays. At best, elements can be changed to a value that represents an element to be ignored. The setting of an element in an array to zero means to delete it. The storage representation of array structure is based on sequential allocation
An array can be considered as the computer's set of pigeon-holes. ...