Sets belong to the associative containers family. This category facilitates very fast element search. Sets contain keys that are always ordered and unique. The class template for sets is like that: std::set<T, Comparator, Allocator> where T is the key type, Comparator is the algorithm with which we perform the ordering and defaults to std::less and
sharing thoughts and ideas in the coding universe!