# List Data Structure

(Redirected from list data structure)

Jump to navigation
Jump to search
A List Data Structure is a data structure that can represent an ordered list/ordered set (whose members are in an ordered relation).

**AKA:**Enumeration.**Context:**- It can range from being a Finite List to being an Infinite List.
- It can be used to represent an Ordered Dataset.
- It can range from being a Ordered Set to being a Ordered Multiset.

**Example(s):**

- an Author List.
- …

**Counter-Example(s):****See:**One-Dimensional Data Structure, Inductive Type, Container ADT, Linked List, Item String, Matrix, List Question, Enumerated Type.

## References

### 2015

- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/List_(abstract_data_type) Retrieved:2015-2-13.
- In computer science, a
**list**or sequence is an abstract data type that represents a sequence of values, where the same value may occur more than once. An instance of a list is a computer representation of the mathematical concept of a finite sequence; the (potentially) infinite analog of a list is a stream. Lists are a basic example of containers, as they contain other values. If the same value occurs multiple times, each occurrence is considered a distinct item. The name**list**is also used for several concrete data structures that can be used to implement abstract lists, especially linked lists. Many programming languages provide support for list data types, and have special syntax and semantics for lists and list operations. A list can often be constructed by writing the items in sequence, separated by commas, semicolons, or spaces, within a pair of delimiters such as parentheses '()', brackets '[]', braces '{}', or angle brackets '<>'. Some languages may allow list types to be indexed or sliced like array types, in which case the data type is more accurately described as an array. In object-oriented programming languages, lists are usually provided as instances of subclasses of a generic "list" class, and traversed via separate iterators. List data types are often implemented using array data structures or linked lists of some sort, but other data structures may be more appropriate for some applications. In some contexts, such as in Lisp programming, the term list may refer specifically to a linked list rather than an array. In type theory and functional programming, abstract lists are usually defined inductively by two operations:*nil*that yields the empty list, and*cons*, which adds an item at the beginning of a list.

- In computer science, a

### 2014

- (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Enumeration Retrieved:2014-10-4.
- An
**enumeration**is a collection of items that is a complete, ordered listing of all of the items in that collection. The term is commonly used in mathematics and theoretical computer science (as well as applied computer science) to refer to a listing of all of the elements of a set. In statistics the term categorical variable is used rather than enumeration. The precise requirements for an enumeration (for example, whether the set must be finite, or whether the list is allowed to contain repetitions) depend on the branch of mathematics and the context in which one is working.Some sets can be enumerated by means of a natural ordering (such as 1, 2, 3, 4, … for the set of positive integers), but in other cases it may be necessary to impose a (perhaps arbitrary) ordering. In some contexts, such as enumerative combinatorics, the term

*enumeration*is used more in the sense of counting*– with emphasis on determination of the number of elements that a set contains, rather than the production of an explicit listing of those elements.*

- An