C++11: std::vector vs std::deque

What are the main differences between std::vector and std::deque in C++11?

The main differences are in memory allocation and performance. std::vector is contiguous in memory, while std::deque allows for efficient insertions and deletions at both ends.

When should I use std::deque instead of std::vector?

Use std::deque when you need to frequently add or remove elements from both ends, as it provides better performance for those operations.

Are there any performance trade-offs I should be aware of?

Yes, std::vector generally has better cache performance due to its contiguous memory layout, while std::deque may have overhead due to its multiple memory blocks.

Can you give an example of when to choose one over the other?

Sure! If you're implementing a stack, std::vector is often preferred for its simplicity and performance. For a double-ended queue, std::deque is the better choice.