How does C++11 std::array compare in performance to other containers?

How does C++11 std::array compare in performance to other containers like std::vector?

C++11's std::array is a fixed-size array that offers better performance than std::vector in certain scenarios, especially for small arrays. It has no dynamic memory allocation overhead, making it faster for access and iteration.

What are the main advantages of using std::array over std::vector?

The main advantages of std::array include fixed size, no dynamic memory allocation, and better cache locality, which can lead to improved performance.

Are there any situations where std::vector would be preferred over std::array?

Yes, std::vector is preferred when you need a dynamic size, as it can grow and shrink at runtime, while std::array cannot.

Can you provide a code example comparing both?

Sure! Here's a simple example:

#include <array>
#include <vector>
#include <iostream>

int main() {
    std::array<int, 5> arr = {1, 2, 3, 4, 5};
    std::vector<int> vec = {1, 2, 3, 4, 5};
    
    for (const auto& elem : arr) {
        std::cout << elem << " ";
    }
    std::cout << std::endl;
    
    for (const auto& elem : vec) {
        std::cout << elem << " ";
    }
    return 0;
}

This code demonstrates how to use both containers.