Advertisement
Guest User

Untitled

a guest
Oct 21st, 2016
63
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.44 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. #include <vector>
  4. using std::vector;
  5. using std::find;
  6. #include <algorithm>
  7. #include <string>
  8. #include <iterator>
  9. #include <utility>
  10.  
  11.  
  12. void range(vector<int> v1, int varToAdd, int &actualRange, int &tRange)
  13. {
  14. int max = -1;
  15. int min = 10000000;
  16. for (int i = 0; i < v1.size(); i++)
  17. {
  18. if (v1[i] > max)
  19. {
  20. max = v1[i];
  21. }
  22. if (v1[i] < min)
  23. {
  24. min = v1[i];
  25. }
  26. }
  27. actualRange = (max - min);
  28.  
  29. //now testing for our added value's range
  30. v1.push_back(varToAdd);
  31. max = -1;
  32. min = 10000000;
  33. for (int i = 0; i < v1.size(); i++)
  34. {
  35. if (v1[i] > max)
  36. {
  37. max = v1[i];
  38. }
  39. if (v1[i] < min)
  40. {
  41. min = v1[i];
  42. }
  43. }
  44. tRange = (max - min);
  45.  
  46. v1.erase(v1.end() - 1);
  47.  
  48.  
  49. }
  50.  
  51. //overloaded function
  52. void range(vector<int> v1, int varToAdd, int &tRange)
  53. {
  54. int max = -1;
  55. int min = 10000000;
  56.  
  57. //now testing for our added value's range
  58. v1.push_back(varToAdd);
  59. max = -1;
  60. min = 10000000;
  61. for (int i = 0; i < v1.size(); i++)
  62. {
  63. if (v1[i] > max)
  64. {
  65. max = v1[i];
  66. }
  67. if (v1[i] < min)
  68. {
  69. min = v1[i];
  70. }
  71. }
  72. tRange = (max - min);
  73.  
  74. v1.erase(v1.end() - 1);
  75.  
  76.  
  77. }
  78.  
  79.  
  80.  
  81. int main()
  82. {
  83. int actualRange = 0;
  84. int tRange = 0;
  85. vector<int> v1 = {45,46,46,46,80};
  86. range(v1, 100, actualRange, tRange);
  87. cout << "actual: " << actualRange<< endl;
  88. cout <<"theoretical: " << tRange << endl;
  89. v1.erase(v1.begin());
  90.  
  91. system("pause");
  92. return 0;
  93.  
  94. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement