Category:Dynamic array

From LiteratePrograms
Jump to: navigation, search

A dynamic array is a simple array data structure that automatically resizes to accomodate an unlimited number of elements. Insertions at the end require only amortized constant time, at the expense of worst-case linear reserved space being wasted. It is known by many names, including:

  • dynamic array
  • growable array
  • resizable array
  • dynamic table
  • array list
  • vector (as in C++'s std::vector)
  • ArrayList (Java and .NET call it this)

See also Double-ended dynamic array.

hijacker
hijacker
hijacker
hijacker

Subcategories

This category has only the following subcategory.