Dynamic array: Difference between revisions

Content deleted Content added
Dcoetzee (talk | contribs)
Variants: +these structures have the problem that indexing into the array is somewhat slower in practice.
Forbsey (talk | contribs)
Fixed common spelling error. see WP:LCM
Line 1:
A '''dynamic array''', '''growable array''', '''resizable array''', '''dynamic table''', or '''array list''' is a [[data structure]], an [[array]] which is automatically expanded to accomodateaccommodate new objects if filled beyond its current size. It may also automatically deallocate some of its unused space to save memory. They have become a popular [[data structure]] in modern mainstream programming languages, supplied with most standard libraries.
 
Note that in this article, a dynamic array is not the same thing as a [[dynamic memory allocation|dynamically-allocated]] array, which is just an ordinary fixed-size array whose size is selected at runtime.