What are the differences between sets and vectors in C++17?

What are the differences between sets and vectors in C++17?

In C++17, sets are collections of unique elements, while vectors are dynamic arrays that can contain duplicates. Sets are implemented as balanced trees, providing logarithmic time complexity for insertions and lookups, whereas vectors offer constant time access but linear time complexity for insertions and deletions.

When should I use a set instead of a vector?

You should use a set when you need to ensure all elements are unique and require fast lookups. Use a vector when you need to maintain the order of elements and allow duplicates.

Can you give an example of when a vector is more beneficial?

Sure! If you're implementing a list of items where duplicates are allowed, like a shopping cart, a vector is more beneficial due to its ability to store multiple identical items and provide fast access by index.

What about performance differences?

Sets generally have slower performance for access due to their tree structure, while vectors provide faster access and iteration. However, if you frequently need to insert or delete elements, sets can be more efficient due to their logarithmic complexity.