More to C - Advanced Programming with C in Linux and on Raspberry Pi by Andrew Johnson

Author:Andrew Johnson
Language: eng
Format: mobi
Publisher: Andrew Johnson
Published: 2017-07-26T07:00:00+00:00

3. We have cheated a bit by using an array of pointers for the records - this still limits us to using a fixed maximum of records. To make it really suave, we would have to use a linked list and then we would only be limited by system memory resources.

8.5 Linked List

This is a special type of data structure which is commonly associated with dynamic memory usage. It ties in closely with the use of structures and pointers in 'C'.

You can first imagine a simple linked list of integers.

The first element of the list is called the Head and the last is called the Tail. Above, we basically have a number and a pointer which tells us where the next element in the list is. The linked list offers us other advantages:-

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.