Lists and list processing

Abstract

In this chapter we will be extending our knowledge of C to include the important topics of lists and list processing. In an earlier chapter we looked at arrays and how they could be used to store data, and we noted some of the restrictions inherent in these data structures: for example, the need to declare an array large enough to hold all the data likely to be needed in any one run of the program. Lists are a general data structure which allow such restrictions to be overcome and which leave the storage allocation details to the software. This chapter can only serve as an introduction to these topics but after working through it you should have a firm grasp of the concepts involved as well as having your understanding of pointers reinforced. Much of this chapter will be centred on functions related to list processing and discussions on their operation. It is important that you read through each one, spend time analysing its operation and test it out on your own system. For this reason exercises are interspersed with the text, rather than appearing at the end of the chapter.

“In my beginning is my end.” T.S. Eliot