Difference between revisions of "List"
From Computer History Wiki
(Another one high on the 'Wanted pages' list) |
(Also 'linked list') |
||
| Line 1: | Line 1: | ||
| − | 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]]. | + | A '''list''' (sometimes given as the more descriptive, although longer, '''linked 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]]. |
[[Category: Software Basics]] | [[Category: Software Basics]] | ||
Latest revision as of 05:18, 15 May 2023
A list (sometimes given as the more descriptive, although longer, linked 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.
