History of Array

	Revision 7 . . (edit) October 29, 2001 9:26 pm by Tsja [free links]
	Revision 6 . . October 26, 2001 1:54 am by (logged).157.137.xxx [Noted that they're sometimes called vectors.]
	Revision 5 . . October 26, 2001 1:50 am by (logged).157.137.xxx [Noted their programming-language support status.]

---

Difference (from prior major revision) (minor diff, author diff)

Changed: 1c1

An array is one of the simplest data structures in computer programming. Arrays hold a group of equally sized data elements in a continuous block of memory. Individual elements are accessed by index? using integers (contrast: [associative array]?).

An array, also known as a vector, is one of the simplest data structures in computer programming. Arrays hold a group of equally sized data elements in a continuous block of memory. Individual elements are accessed by index? using integers (contrast: [associative array]?).

Changed: 3c3

Arrays permit efficient (constant time, O(1)) random access but not efficient insertion and deletion of elements (which are O(n), where n is the size of the array). Compare linked lists which have the opposite trade-off.

Arrays permit efficient (constant time, O(1)) random access but not efficient insertion and deletion of elements (which are O(n), where n is the size of the array). Compare linked lists which have the opposite trade-off.

Changed: 5c5

Most programming languages have arrays built in.

Most programming languages have arrays built in.