From 3d8985939793a5e2fd14263a4239c786e2c8135b Mon Sep 17 00:00:00 2001
From: "Dmitry (KolomeytsevDA)" <KolomeytsevDA@mpei.ru>
Date: Sun, 5 May 2024 19:57:34 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D1=8B=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B8?=
 =?UTF-8?q?=20=D1=80=D0=B0=D0=B1=D0=BE=D1=82=D1=8B=20=D1=81=20=D0=B3=D0=B8?=
 =?UTF-8?q?=D1=81=D1=82=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D0=BE=D0=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 lab34.cpp | 48 ++++++++++++++++++++++++++----------------------
 1 file changed, 26 insertions(+), 22 deletions(-)

diff --git a/lab34.cpp b/lab34.cpp
index 596322d..b151911 100644
--- a/lab34.cpp
+++ b/lab34.cpp
@@ -35,19 +35,16 @@ Input input_data()
 
     return in;
 }
-using namespace std;
 
 void find_minmax(const vector<double> &numbers, double &min, double &max)
 {
     min = numbers[0];
     for (double x : numbers)
     {
-
         if (x < min)
         {
             min = x;
         }
-
         else if (x > max)
         {
             max = x;
@@ -55,30 +52,25 @@ void find_minmax(const vector<double> &numbers, double &min, double &max)
     }
 }
 
-int main()
+vector<int> make_histogram(const vector<double> &numbers, size_t bin_count)
 {
-    Input in = input_data();
-
-    vector<int> bins(in.bin_count);
-    vector<double> height(in.bin_count);
-
+    vector<int> bins(bin_count);
     int max_count = bins[0];
-    double min = in.numbers[0];
-    double max = in.numbers[0];
+    double min = numbers[0];
+    double max = numbers[0];
 
-    find_minmax(in.numbers, min, max);
+    find_minmax(numbers, min, max);
+    double bin_size = (max - min) / bin_count;
 
-    double bin_size = (max - min) / in.bin_count;
-
-    for (size_t i = 0; i < in.numbers.size(); i++)
+    for (size_t i = 0; i < numbers.size(); i++)
     {
         bool found = false;
-        for (size_t j = 0; (j < in.bin_count - 1) && !found; j++)
+        for (size_t j = 0; (j < bin_count - 1) && !found; j++)
         {
             auto lo = min + j * bin_size;
             auto hi = min + (j + 1) * bin_size;
 
-            if ((lo <= in.numbers[i]) && (in.numbers[i] < hi))
+            if ((lo <= numbers[i]) && (numbers[i] < hi))
             {
                 bins[j]++;
                 found = true;
@@ -87,18 +79,24 @@ int main()
 
         if (!found)
         {
-            bins[in.bin_count - 1]++;
+            bins[bin_count - 1]++;
         }
     }
-    for (int i = 0; i < in.bin_count; i++)
+    return bins;
+}
+
+void show_histogram_text(vector<int> &bins, size_t bin_count)
+{
+    int max_count = bins[0];
+    for (int i = 0; i < bin_count; i++)
     {
         if (bins[i] > max_count)
         {
             max_count = bins[i];
         }
     }
-
-    for (int i = 0; i < in.bin_count; i++)
+    vector<double> height(bin_count);
+    for (int i = 0; i < bin_count; i++)
     {
         if (bins[i] > MAX_ASTERISK)
         {
@@ -108,7 +106,7 @@ int main()
             height[i] = bins[i];
     }
 
-    for (int i = 0; i < in.bin_count; i++)
+    for (int i = 0; i < bin_count; i++)
     {
 
         if (bins[i] < 100)
@@ -129,6 +127,12 @@ int main()
         }
         cout << endl;
     }
+}
 
+int main()
+{
+    auto in = input_data();
+    auto bins = make_histogram(in.numbers, in.bin_count);
+    show_histogram_text(bins, in.bin_count);
     return 0;
 }
\ No newline at end of file