Difference between revisions of "Array"
From Computer History Wiki
(An OK start) |
m (better cats) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 2: | Line 2: | ||
Given the naming system normally used for [[main memory]] (itself usually a large array), single-dimension arrays are quite simple to provide - a [[base address]] is added to the index (often through use of an [[index register]]) to give the [[address]] of the desired array element. | Given the naming system normally used for [[main memory]] (itself usually a large array), single-dimension arrays are quite simple to provide - a [[base address]] is added to the index (often through use of an [[index register]]) to give the [[address]] of the desired array element. | ||
| + | |||
| + | {{semi-stub}} | ||
| + | |||
| + | [[Category: CPU Basics]] | ||
| + | [[Category: Software Basics]] | ||
Latest revision as of 16:21, 15 December 2018
An array is a collection of identical data items (either 'primitive' types such as integers, or constructed types such as structures), often called the elements of the array, one of which can be selected by one or more (depending on how many dimensions there are in the array) index variables.
Given the naming system normally used for main memory (itself usually a large array), single-dimension arrays are quite simple to provide - a base address is added to the index (often through use of an index register) to give the address of the desired array element.
