Question

c++ program

1a) Implement a class named ???????. Start by adding the following ?????? members:

- distance, a variable member of type double.

- Non-default constructor which receives a value in order to initialize the variable distance.

- Input stream operator to read a value from the command line into the variable distance.

1b) Write a test ???? as follows:

- Create a vector to hold instances of type ???????

- Use the following ??? loop to read values from the command prompt. Test input values are provided below.

??? (??? ? = 0; ? < 25; + + ?)

{ ??????? ?(−1); ??? >> ?; ?????. ???ℎ_????(?);

}

- Use the STL ???? function from the algorithm header file  Print the values of the ??????. Notice that the values are now sorted.

- Use the STL ???? function to search for a ??????? once with ???????? of 11.11 and once with ???????? of 73.9. Note that the ???? function accepts 3 arguments, ? ????? ????????, ?? ??? ????????, and ?? ?????? of type ???????. The ???? function returns an object of type iterator.

- If the value is found, print ?????. If the value is not found, print ??? ?????

Input these test values:

33.95

68.03

10.16

10.45

33.45

18.82

11.96

89.05

21.05

7.16

31.90

75.43

2.70

22.39

73.37

59.44

90.89

43.22

73.90

75.55

20.09

23.47

70.82

93.69

12.61

Answer 1

Please find the code below::

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class DistObj{
public:
   double distance;
   DistObj(double d){
       distance = d;
   }
   friend istream& operator>>(istream& is, DistObj &obj);
   bool operator <(DistObj &obj){
       if(distance<obj.distance){
           return true;
       }else{
           return false;
       }
   }

   bool operator ==(const DistObj &obj){
       if(distance==obj.distance){
           return true;
       }else{
           return false;
       }
   }
};

istream& operator>>(istream& is, DistObj &obj) {
   is>>obj.distance;
   return is;
}

int main(){
   vector<DistObj> myVec;
   cout<<"Please enter distance below"<<endl;
   for(int i=0;i<25;i++){
       DistObj c(-1);
       cin>>c;
       myVec.push_back(c);
   }
   sort(myVec.begin(), myVec.end());

   cout<<"Sorted distance is as below"<<endl;
   for(int i=0;i<25;i++){
       cout<<myVec[i].distance<<endl;
   }

   vector<DistObj>::iterator iter;
   DistObj findMe(11.11);
   iter = find(myVec.begin(), myVec.end(), findMe);
   if(iter != myVec.end()){
       cout<<"FOUND"<<endl;
   }
   else
   {
       cout<<"NOT FOUND"<<endl;
   }

   DistObj findMe2(73.9);
   iter = find(myVec.begin(), myVec.end(), findMe2);
   if(iter != myVec.end()){
       cout<<"FOUND"<<endl;
   }
   else
   {
       cout<<"NOT FOUND"<<endl;
   }
   return 0;
}

output: