C++ STL Sets Program (Part 1)
In this tutorial, we will learn about the working of a Set and its implementation in the C++ programming language.
What is a Set?
In programming, a Set is used to store unique values of a list and also automatically providing an ordering to its elements. By default, the ordering is in ascending order.
The elements are inserted using the
insert() method. If the same value is inserted multiple times, the set automatically deletes the duplicates and only store the single copy of that element.
The elements of the Set are deleted using the
For a better understanding of its implementation, refer to the well-commented C++ code given below.
using namespace std;
//Function to print the elements of the set using an iterator
void show(set<int> s)
//declaring an iterator to iterate through the set
for (i = s.begin(); i != s.end(); i++)
cout << *i << " "; //accessing the elements of the set using * as i stores the address to each element
cout << endl;
cout << "\n\nWelcome to Studytonight :-)\n\n\n";
cout << " ===== Program to demonstrate the working of Sets (Part 1), in CPP ===== \n\n\n\n";
cout << " *** Set automatically removes the duplicate elements and also sorts the input in ascending order *** \n\n";
//Set declaration (Set of integers)
//Filling the elements by using the insert() method.
cout << "\n\nFilling the Set with integers in random order."; //Set automatically stores them in order
cout << "\n\nThe elements of the Set are: ";
cout << "\n\nAfter deleting the element 54 from the set using the erase() method, it becomes: ";
cout << "\n\n\n";
We hope that this post helped you develop a better understanding of the concept of Set and its implementation in C++. For any query, feel free to reach out to us via the comments section down below.
Keep Learning : )