Difference between revisions of "Array data structure"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) |
||
| Line 1: | Line 1: | ||
| − | 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. | + | 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]]. |
== Description == | == Description == | ||
| − | An array is stored so that the position of each element can be computed from its index tuple by a mathematical formula. | + | 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. | + | The simplest type of data structure is a [[linear array]], also called one-dimensional array. |
== See also == | == See also == | ||
Revision as of 02:08, 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.
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.
See also
External links
- Array data structure @ Wikipedia
