code: func find_minmax

main.cpp

@@ -1,29 +1,36 @@
 #include <iostream>
 #include <vector>
+
 const size_t SCREEN_WIDTH = 80;
 const size_t MAX_STAR = SCREEN_WIDTH - 3 - 1;
 using namespace std;
 
-int main()
+struct Input
+    {
+        vector<double> numbers;
+        size_t bin_count{};
+    };
+
+Input input_data()
 {
-    size_t number_count;
+    Input in;
-    cerr << "Enter number count: ";
+    size_t number_count, bin_count;
     cin >> number_count;
-    vector<double> numbers(number_count);
+
+    in.numbers.resize(number_count);
 
     for (size_t i = 0; i < number_count; i++)
     {
-        cin >> numbers[i];
+        cin >> in.numbers[i];
     }
 
-    size_t bin_count;
+    cin >> in.bin_count;
-    cerr << "Enter bin count: ";
+    return in;
-    cin >> bin_count;
+}
-    vector<size_t> bins(bin_count);
-
-    double min = numbers[0];
-    double max = numbers[0];
 
+void find_minmax(const vector<double>& numbers, double& min, double& max)
+{
+    min = numbers[0];
     for (double x : numbers)
     {
         if (x < min)
@@ -35,17 +42,26 @@ int main()
             max = x;
         }
     }
+}
 
-    double bin_size = (max - min) / bin_count;
+int main()
+{
+    Input in = input_data();
 
-    for (size_t i = 0; i < number_count; i++)
+    vector<double>bins(in.bin_count);
+
+    double min, max;
+    find_minmax(in.numbers, min, max);
+
+    double bin_size = (max - min) / in.bin_count;
+    for (size_t i = 0; i < in.numbers.size(); i++)
     {
         bool found = false;
-        for (size_t j = 0; (j < bin_count - 1) && !found; j++)
+        for (size_t j = 0; (j < in.bin_count - 1) && !found; j++)
         {
             auto lo = min + j * bin_size;
             auto hi = min + (j + 1) * bin_size;
-            if ((lo <= numbers[i]) && (numbers[i] < hi))
+            if ((lo <= in.numbers[i]) && (in.numbers[i] < hi))
             {
                 bins[j]++;
                 found = true;
@@ -53,12 +69,12 @@ int main()
         }
         if (!found)
         {
-            bins[bin_count - 1]++;
+            bins[in.bin_count - 1]++;
         }
     }
 
     double b;
-    for (size_t i = 0; i < bin_count; i++)
+    for (size_t i = 0; i < in.bin_count-1; i++)
     {
         if (bins[i] > bins[i+1])
         {
@@ -69,7 +85,6 @@ int main()
     }
 
     size_t max_star_search = bins[-1]; // поиск наибольшего кол-ва из корзины
-
     if (max_star_search > MAX_STAR)
     {
         for (size_t x : bins)
@@ -111,6 +126,5 @@ int main()
             cout << endl;
         }
     }
-
     return 0;
 }