std::vector versus std::array in C++

by

std::vector is a template class that encapsulate a dynamic array1, stored in the heap, that grows and shrinks automatically if elements are added or removed. It provides all the hooks (begin(), end(), iterators, etc) that make it work fine with the rest of the STL. It also has several useful methods that let you perform operations that on a normal array would be cumbersome, like e.g. inserting elements in the middle of a vector (it handles all the work of moving the following elements behind the scenes).

Since it stores the elements in memory allocated on the heap, it has some overhead in respect to static arrays.

std::array is a template class that encapsulate a statically-sized array, stored inside the object itself, which means that, if you instantiate the class on the stack, the array itself will be on the stack. Its size has to be known at compile time (it’s passed as a template parameter), and it cannot grow or shrink.

It’s more limited than std::vector, but it’s often more efficient, especially for small sizes, because in practice it’s mostly a lightweight wrapper around a C-style array. However, it’s more secure, since the implicit conversion to pointer is disabled, and it provides much of the STL-related functionality of std::vector and of the other containers, so you can use it easily with STL algorithms & co. Anyhow, for the very limitation of fixed size it’s much less flexible than std::vector.

For an introduction to std::array, have a look at this article; for a quick introduction to std::vector and to the the operations that are possible on it, you may want to look at its documentation.

  1. Actually, I think that in the standard they are described in terms of maximum complexity of the different operations (e.g. random access in constant time, iteration over all the elements in linear time, add and removal of elements at the end in constant amortized time, etc), but AFAIK there’s no other method of fulfilling such requirements other than using a dynamic array. As stated by @Lucretiel, the standard actually requires that the elements are stored contiguously, so it is a dynamic array, stored where the associated allocator puts it.

More Related Contents:

  1. Invalid operands to binary expression while implementing vector [closed]
  2. Difficulties on atributting a array to another [closed]
  3. Array of vectors
  4. Using arrays or std::vectors in C++, what’s the performance gap?
  5. How to convert vector to array
  6. Is std::vector so much slower than plain arrays?
  7. Correct way to work with vector of arrays
  8. Arrays vs Vectors: Introductory Similarities and Differences [closed]
  9. How to initialize std::vector from C-style array?
  10. Convert Mat to Array/Vector in OpenCV
  11. What is the difference between std::array and std::vector? When do you use one over other? [duplicate]
  12. How to initialize a vector in C++ [duplicate]
  13. Are vectors passed to functions by value or by reference in C++
  14. What is the simplest way to convert array to vector?
  15. C++ std::vector vs array in the real world
  16. splitting a string into an array in C++ without using vector
  17. Is it possible to initialize std::vector over already allocated memory?
  18. array vs vector vs list
  19. C++ N nested vectors at runtime
  20. C++ 2 dimensional array with variable size rows
  21. C++ STL: Array vs Vector: Raw element accessing performance
  22. How to cheaply assign C-style array to std::vector?
  23. How do I compare chars (or strings) using void functions, also comparing chars that were taken from a struct array
  24. Removing item from vector, while in C++11 range ‘for’ loop?
  25. What is the difference between Static and Dynamic arrays in C++?
  26. How is a vector’s data aligned?
  27. How can I use an array as map value?
  28. How to read / write a struct in Binary Files?
  29. How to erase & delete pointers to objects stored in a vector?
  30. Where are string literals stored, and can I modify them?

Leave a Comment