find_minmax

maincpp.cpp

@@ -1,42 +1,55 @@
 #include <vector>
 #include <iostream>
 using namespace std;
-int main() {
+struct Input {
-    size_t n;
+    vector<double> vec;
-    int korz;
+    size_t korz{};
+};
+Input input_data()
+{
+    Input in;
+    size_t n, korz;
+
     cerr << "Number of elem ";
     cin >> n;
-    vector<float> vec(n);
+    in.vec.resize(n);
-    for (size_t i = 0; i < vec.size(); i++) {
+    for (size_t i = 0; i < n; i++)
-        //cout << i + 1 << ".";
+        cin >> in.vec[i];
-        cin >> vec[i];
+    cerr << "Enter bin count: ";
-    }
+    cin >> in.korz;
-    cerr << "Number of baskets ";
+    return in;
-    cin >> korz;
+}
-    vector<size_t> bins(korz);
+void find_minmax(vector<double> vec, double& min, double& max) {
-    double mn = vec[0];
+    min = vec[0];
-    double mx = vec[0];
+    max = vec[0];
     for (double x : vec) {
-        if (x < mn) {
+        if (x < min) {
-            mn = x;
+            min = x;
         }
-        else if (x > mx) {
+        else
-            mx = x;
+        {
+            max = x;
         }
     }
-    float bin_size = (mx - mn) / korz;
+}
-    for (size_t i = 0; i < vec.size(); i++) {
+int main() {
+    auto in = input_data();
+    vector<size_t> bins(in.korz);
+    double mn, mx;
+    find_minmax(in.vec, mn, mx);
+    float bin_size = (mx - mn) / in.korz;
+    for (size_t i = 0; i < in.vec.size(); i++) {
         bool fl = false;
-        for (size_t j = 0; (j < korz - 1) && !fl; j++) {
+        for (size_t j = 0; (j < in.korz - 1) && !fl; j++) {
             auto lo = mn + j * bin_size;
             auto hi = mn + (j + 1) * bin_size;
-            if ((lo <= vec[i]) && (vec[i] < hi)) {
+            if ((lo <= in.vec[i]) && (in.vec[i] < hi)) {
                 bins[j]++;
                 fl = true;
             }
         }
         if (!fl) {
-            bins[korz - 1]++;
+            bins[in.korz - 1]++;
 
         }
     }