Difference between revisions of "Array data structure"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) (→Description) |
||
| Line 6: | Line 6: | ||
The simplest type of data structure is a [[linear array]], also called one-dimensional array. | The simplest type of data structure is a [[linear array]], also called one-dimensional array. | ||
| + | |||
| + | == History == | ||
| + | |||
| + | Arrays are among the oldest and most important data structures, and are used by almost every [[computer program]]. | ||
== See also == | == See also == | ||
Revision as of 02:10, 23 February 2016
In computer science, an array data structure (or simply an array) is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key.
Contents
Description
An array is stored so that the position of each element can be computed from its index tuple by a mathematical formula.
The simplest type of data structure is a linear array, also called one-dimensional array.
History
Arrays are among the oldest and most important data structures, and are used by almost every computer program.
See also
External links
- Array data structure @ Wikipedia
