Quiz MCQ stl lower_bound set

How is the output calculated?
What will be the output of the following C++ code?

#include
#include
#include
using namespace std;
int main()
{
sets;
s.insert(1);
s.insert(5);
s.insert(7);
s.insert(2);
s.insert(12);
s.insert(10);
auto it = s.lower_bound(15);
cout<< *it <<endl;
return 0;
}

hello @S19APPN0069
Answer must be 6
*s.end()= number of elements in the set.
In the case when the element being searched is greater than the maximum element the set the returned value is number of elements in the set which in this case is 6.

1 Like