From Computer History Wiki
Jump to: navigation, search

A list is a common form of data structure, one composed of elements arranged in a chain. When the list is in main memory (by far the most common), the usual method on indicating the next element in the chain is to give its address in the previous one. With lists stored elsewhere (e.g. in secondary storage), again, each element will indicate the next one - an example is the 'free list' in the UNIX file system.