C++11: std::vector vs std::list

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

The main differences are in memory allocation and performance. std::vector is a dynamic array, while std::list is a doubly linked list.

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

Use std::vector when you need fast random access and when the size of the container is known in advance.

Are there any scenarios where std::list is preferred?

Yes, std::list is preferred when you need frequent insertions and deletions from the middle of the container.

How do the iterators of std::vector and std::list differ?

std::vector iterators are random access, allowing you to jump to any element, while std::list iterators are bidirectional.

Can you give an example of when to use each?

Sure! Use std::vector for storing a collection of items where you need fast access, like a list of scores. Use std::list for a playlist where you frequently add or remove songs.