What are the differences between C++11 containers?

What are the differences between C++11 containers?

C++11 introduced several new containers like std::array, std::unordered_map, and std::forward_list. Each has unique features.

Can you explain when to use std::vector over std::list?

Use std::vector when you need fast random access and when the size is known. std::list is better for frequent insertions/deletions.

What about std::unordered_map? When should I use it?

std::unordered_map is ideal for fast lookups and when you don't need the elements in a specific order. It's based on hash tables.

Are there any performance considerations I should be aware of?

Yes, std::vector has better cache performance due to contiguous memory, while std::unordered_map has overhead from hashing.