Sets are a type of associative containers in which each element has to be unique, because the value of the element identifies it. The value of the element cannot be modified once it is added to the set, though it is possible to remove and add the modified value of that element.
set::empty()
empty() function is used to check if the set container is empty or not.
Syntax :
setname.empty()
Parameters :
No parameters are passed.
Returns :
True, if set is empty
False, Otherwise
Examples:
Input : myset{1, 2, 3, 4, 5};
myset.empty();
Output : False
Input : myset{};
myset.empty();
Output : True
Errors and Exceptions
1. It has a no exception throw guarantee.
2. Shows error when a parameter is passed.
#include <iostream>
#include <set>
using namespace std;
int main()
{
set< int > myset{};
if (myset.empty()) {
cout << "True" ;
}
else {
cout << "False" ;
}
return 0;
}
|
Output:
True
#include <iostream>
#include <set>
using namespace std;
int main()
{
set< char > myset{ 'A' , 'b' };
if (myset.empty()) {
cout << "True" ;
}
else {
cout << "False" ;
}
|
Output:
False
Time Complexity : O(1)
Application :
Given a set of integers, find the sum of the all the integers.
Input : 1, 5, 6, 3, 9, 2
Output : 26
Explanation - 1+5+6+3+9+2 = 26
Algorithm
1. Check if the set is empty, if not add the first element to a variable initialised as 0, and erase the first element.
2. Repeat this step until the set is empty.
3. Print the final value of the variable.
#include<iostream>
#include<set>
using namespace std;
int main()
{
int sum = 0;
set< int > myset{ 1, 5, 6, 3, 9, 2 };
while (!myset.empty()){
sum+= *myset.begin();
myset.erase(myset.begin());
}
cout<<sum<<endl;
return 0;
}
|
Output:
26
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
17 Jun, 2020
Like Article
Save Article