Image: Wikimedia Commons

array data structure

Data structure holding elements in a contiguous memory block

EntityQ186152

Also known as array · array index · arrays · sequence

Subclass of: data structure
, collection

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

In computer science, an array is a data structure consisting of a collection of elements, of the same memory size, each identified by at least one array index or key, the collection of which may be a tuple, known as an index tuple. In general, an array is a mutable and linear collection of elements with the same data type. An array is stored such 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 a one-dimensional array.

Overview

All data

28 statements · 21% with external sources · numbers in brackets are citations

Name in kana: はいれつ
Different from: Tablica
Has characteristic: connectedness
locality of reference
Implementation of: list
string applies to part: character

On other databases

18 identifiers linking array data structure across the web's reference databases

Data quality

statements

21%

externally sourced

Source last edited September 23, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q186152

API docs, limits & keys

Cite this page

AIDB. (2026). array data structure (Q186152). Retrieved from https://aidb.si/e/array-data-structure-Q186152