Question

In c++

#include <iostream > 2 #include <set> #înclude <functional» 5 using namespace std; 7 //your code 9 int main) 4 6 8 1e set <double, greater<double>>valuesA --1.1, 2.9, -2.3, 2.71 J: set <double, greater<double>> valuesB -3.14, 2.71, -3.88, 2.19; double value; cin > value; 12 13 14 15 16 17 18 19 /your code return ;

Answer 1

Hello,

The following is the solution for this assignment.

I have added comments in the code for your easy reference. If you need more information or have queries, leave me a comment.

If this solution helps you with this assignment, do upvote this answer. Thank you.

//Code for this solution

//File: sets.cpp

#include <iostream>
#include <set>
#include <functional>
using namespace std;
//Function to find "num" in the set
void find_set(set<double, greater<double>>& values, double num) {
//Find if the num exists in the set
const int count = values.count(num);
if(count > 0) {
//If found, print the rest of the elements in the set
for (auto it = values.find(num); it != values.end(); ++it)
cout << ' ' << *it;
} else {
//If not found, print the string
cout << " Not found";
}
}
int main() {
//Test data
set<double, greater<double>> valuesA = { -1.1, 2.9, -2.3, 2.71 };
set<double, greater<double>> valuesB = { -3.14, 2.71, -3.88, 2.19 };
//Get user input
double value;
cout << "Enter a number: ";
cin >> value;
//call the method to find if value exists in the sets
find_set(valuesA, value);
find_set(valuesB, value);
return 0;
}

//Output for this solution