Category:Double-ended dynamic array

From LiteratePrograms
Jump to: navigation, search

A double-ended dynamic array is a type of dynamic array in which the data is stored in the middle of the allocated array, with free space on both sides. This allows us to add and remove from either end in amortized constant time while preserving ordinary indexing (although unlike in an ordinary dynamic array, the base index changes over time). The primary mainstream implementation is C++'s std::deque.

This category currently contains no pages or media.