code: второй этап, до функции расчета гистограммы

main.cpp

@@ -5,25 +5,48 @@
 using namespace std;
 
 struct Input
-    {
+{
-        vector<double> numbers;
+    vector<double> numbers;
-        size_t bin_count{};
+    size_t bin_count{};
-    };
+};
+
+Input input_data()
+{
+    size_t number_count;
+    cin >> number_count;
 
-    Input input_data()
+    Input in;
+    in.numbers.resize(number_count);
+    for (size_t i = 0; i < number_count; i++)
     {
-        size_t number_count;
+        cin >> in.numbers[i];
-        cin >> number_count;
+    }
+    cin>> in.bin_count;
+    return in;
+}
 
-        Input in;
+void
-        in.numbers.resize(number_count);
+find_minmax(vector<double> numbers, double& min, double& max)
-        for (size_t i = 0; i < number_count; i++)
+{
+    min = numbers[0];
+    max = numbers[0];
+    for (double x : numbers)
+    {
+        if (x < min)
         {
-            cin >> in.numbers[i];
+            min = x;
+        }
+        else if (x > max)
+        {
+            max = x;
         }
-        cin>> in.bin_count;
-        return in;
     }
+    return;
+}
+
+
+
+
 
 
 int main()
@@ -40,19 +63,9 @@ int main()
 
     vector <size_t> bins(in.bin_count);
 
-    double min = in.numbers[0];
+    double min;
-    double max = in.numbers[0];
+    double max;
-    for (double x : in.numbers)
+    find_minmax (in.numbers, min, max);
-    {
-        if (x < min)
-        {
-            min = x;
-        }
-        else if (x > max)
-        {
-            max = x;
-        }
-    }
 
     double bin_size = (max - min) / in.bin_count;