5.3.1 Sets

Sets are a very efficient data structure to store a common group of values like a vector may, but one of the key differences is that a set doesn’t contain duplicates.

Sets are an associative data structure, which means in part that the elements are not stored sequentially and therefore there is no index to look up a value in a set. Instead, sets are stored in a way that makes searching for elements very quick and efficient.