C++11: Set vs Vector

What are the main differences between Set and Vector in C++11?

In C++11, a Set is an associative container that contains a sorted set of unique elements, while a Vector is a dynamic array that can store duplicate elements and allows random access.

When should I use a Set instead of a Vector?

Use a Set when you need to maintain unique elements and require fast lookups, while a Vector is better for ordered collections and when you need to access elements by index.

Can you give me an example of when to use each?

Sure! Use a Set for storing unique user IDs, ensuring no duplicates. Use a Vector for storing a list of scores where duplicates are allowed.

What are the performance implications of using one over the other?

Sets generally have O(log n) complexity for insertions and lookups, while Vectors have O(1) for access but O(n) for insertions if resizing is needed.