Difference between revisions of "List"
From Conservapedia
m |
m (Fix link) |
||
| Line 1: | Line 1: | ||
In computer terms, a list is a linear collection of similar data. The internal organization varies based on the type of list. In a [[Linked list]], each item in the list has a link to the next, and/or preceding item. In a contiguous list there is no need for links because the items occupy a contiguous area of memory. Contiguous lists are more suitable for random access, similar to an [[array]], but resizing the list can be expensive. It is a less-expensive operation to add or remove items from Linked lists, but the lists must be accessed sequentially. | In computer terms, a list is a linear collection of similar data. The internal organization varies based on the type of list. In a [[Linked list]], each item in the list has a link to the next, and/or preceding item. In a contiguous list there is no need for links because the items occupy a contiguous area of memory. Contiguous lists are more suitable for random access, similar to an [[array]], but resizing the list can be expensive. It is a less-expensive operation to add or remove items from Linked lists, but the lists must be accessed sequentially. | ||
| − | A hybrid approach uses sections of contiguous items linked together. This approach is used in certain applications, such as lists of file extents in [[File | + | A hybrid approach uses sections of contiguous items linked together. This approach is used in certain applications, such as lists of file extents in [[File System]]s. |
Latest revision as of 02:21, April 28, 2021
In computer terms, a list is a linear collection of similar data. The internal organization varies based on the type of list. In a Linked list, each item in the list has a link to the next, and/or preceding item. In a contiguous list there is no need for links because the items occupy a contiguous area of memory. Contiguous lists are more suitable for random access, similar to an array, but resizing the list can be expensive. It is a less-expensive operation to add or remove items from Linked lists, but the lists must be accessed sequentially.
A hybrid approach uses sections of contiguous items linked together. This approach is used in certain applications, such as lists of file extents in File Systems.
