Difference between revisions of "Array data structure"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) |
||
| Line 23: | Line 23: | ||
* [https://en.wikipedia.org/wiki/Array_data_structure Array data structure] @ Wikipedia | * [https://en.wikipedia.org/wiki/Array_data_structure Array data structure] @ Wikipedia | ||
| + | * [https://medium.freecodecamp.com/understanding-array-prototype-reduce-and-recursion-using-apple-pie-f60cde58ea51 Understanding Array.prototype.reduce() and recursion using apple pie] @ freeCodeCamp | ||
[[Category:Computer science]] | [[Category:Computer science]] | ||
[[Category:Data]] | [[Category:Data]] | ||
[[Category:Data structures]] | [[Category:Data structures]] | ||
Latest revision as of 08:36, 30 May 2017
In computer science, an array data structure (or simply an array) is a data structure consisting of a collection of data 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
- Understanding Array.prototype.reduce() and recursion using apple pie @ freeCodeCamp
