Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- #include <vector>
- using std::vector;
- using std::find;
- #include <algorithm>
- #include <string>
- #include <iterator>
- #include <utility>
- void range(vector<int> v1, int varToAdd, int &actualRange, int &tRange)
- {
- int max = -1;
- int min = 10000000;
- for (int i = 0; i < v1.size(); i++)
- {
- if (v1[i] > max)
- {
- max = v1[i];
- }
- if (v1[i] < min)
- {
- min = v1[i];
- }
- }
- actualRange = (max - min);
- //now testing for our added value's range
- v1.push_back(varToAdd);
- max = -1;
- min = 10000000;
- for (int i = 0; i < v1.size(); i++)
- {
- if (v1[i] > max)
- {
- max = v1[i];
- }
- if (v1[i] < min)
- {
- min = v1[i];
- }
- }
- tRange = (max - min);
- v1.erase(v1.end() - 1);
- }
- //overloaded function
- void range(vector<int> v1, int varToAdd, int &tRange)
- {
- int max = -1;
- int min = 10000000;
- //now testing for our added value's range
- v1.push_back(varToAdd);
- max = -1;
- min = 10000000;
- for (int i = 0; i < v1.size(); i++)
- {
- if (v1[i] > max)
- {
- max = v1[i];
- }
- if (v1[i] < min)
- {
- min = v1[i];
- }
- }
- tRange = (max - min);
- v1.erase(v1.end() - 1);
- }
- int main()
- {
- int actualRange = 0;
- int tRange = 0;
- vector<int> v1 = {45,46,46,46,80};
- range(v1, 100, actualRange, tRange);
- cout << "actual: " << actualRange<< endl;
- cout <<"theoretical: " << tRange << endl;
- v1.erase(v1.begin());
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement