Chapter 17.5, Problem 17.35CP

Program Plan Intro

Set:

In C++, an associative container which is used to store the unique values is referred as “set”.

• A “set” container can be implemented using the STL (Standard Template Library) class “set” template. The importance of set are discussed as follow as:
  • “set” elements must be “unique”, which means two elements in a “set” cannot have same values.
  • Value of the element in a set cannot be modified, but they can be inserted or removed.
  • “set” elements are automatically sorted in ascending order.

Multiset:

• They are the associative containers which is similar to set.
• Here, multiple elements can have same values.
• To use multiset class, we need to include “#include <set>” header file.

Unordered_set:

• They are the container class.
• They store the unique elements.
• These unique elements do not follow a particular order.
• Fast retrieval of unique elements takes place based on their value.

Unordered_multiset:

• They are the container class.
• The elements stored here do not follow any particular order.
• It is similar to that of the “unordered_set” but they allow different elements to have equivalent values.