From d7490c55bbc85e34975f62651a582f48c1479de3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=D0=A4=D0=BE=D0=BD=D0=BE=D0=B2=20=D0=90=D0=BB=D0=B5=D0=BA?=
 =?UTF-8?q?=D1=81=D0=B0=D0=BD=D0=B4=D1=80?= <FonovAD@Mpei.ru>
Date: Sat, 22 Apr 2023 18:40:05 +0300
Subject: [PATCH] =?UTF-8?q?Code:=20=D1=80=D0=B5=D1=84=D0=B0=D0=BA=D1=82?=
 =?UTF-8?q?=D0=BE=D1=80=D0=B8=D0=BD=D0=B3-=20=D1=84=D1=83=D0=BD=D0=BA?=
 =?UTF-8?q?=D1=86=D0=B8=D1=8F=20=D1=84=D0=BE=D1=80=D0=BC=D0=B8=D1=80=D0=BE?=
 =?UTF-8?q?=D0=B2=D0=B0=D0=BD=D0=B8=D1=8F=20=D0=BA=D0=BE=D1=80=D0=B7=D0=B8?=
 =?UTF-8?q?=D0=BD=20=D0=B8=20=D0=B2=D1=8B=D0=B2=D0=BE=D0=B4=20=D0=B3=D0=B8?=
 =?UTF-8?q?=D1=81=D1=82=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B=20=D0=B2?=
 =?UTF-8?q?=D1=8B=D0=BD=D0=B5=D1=81=D0=B5=D0=BD=D1=8B=20=D0=B8=D0=B7=20mai?=
 =?UTF-8?q?n=20=D0=B2=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B8?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 34 ++++++++++++++++++++++------------
 1 file changed, 22 insertions(+), 12 deletions(-)

diff --git a/main.cpp b/main.cpp
index 9289174..8ba0c00 100644
--- a/main.cpp
+++ b/main.cpp
@@ -25,7 +25,7 @@ Input input_data()
     return in;
 }
 
-void find_minmax(const std::vector<double>& numbers, double &min, double &max)
+void find_minmax(const std::vector<double> &numbers, double &min, double &max)
 {
     min = numbers[0];
     max = numbers[0];
@@ -42,22 +42,22 @@ void find_minmax(const std::vector<double>& numbers, double &min, double &max)
     }
 }
 
-int main()
+std::vector<size_t> make_histogram(const std::vector<double> &numbers, const size_t &bin_count)
 {
-    Input in = input_data();
-    std::vector<size_t> bins(in.bin_count);
     double min, max;
-    find_minmax(in.numbers, min, max);
-    double bin_size = (max - min) / in.bin_count;
+    find_minmax(numbers, min, max);
+
+    std::vector<size_t> bins(bin_count);
+    double bin_size = (max - min) / 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;
@@ -65,10 +65,14 @@ int main()
         }
         if (!found)
         {
-            bins[in.bin_count - 1]++;
+            bins[bin_count - 1]++;
         }
     }
+    return bins;
+}
 
+void show_histogram_text(const std::vector<size_t> &bins, const std::vector<double> &numbers)
+{
     const size_t SCREEN_WIDTH = 80;
     const size_t MAX_ASTERISK = SCREEN_WIDTH - 5;
     size_t max_count = 0;
@@ -90,13 +94,13 @@ int main()
             height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
         }
 
-        int fraction = bin * 100 / in.numbers.size();
+        int fraction = bin * 100 / numbers.size();
 
         if (fraction < 100)
             std::cout << ' ';
         if (fraction < 10)
             std::cout << ' ';
-        std::cout << fraction << "%|";
+        std::cout << fraction << "|";
 
         for (size_t j = 0; j < height; j++)
         {
@@ -104,6 +108,12 @@ int main()
         }
         std::cout << std::endl;
     }
+}
 
+int main()
+{
+    Input in = input_data();
+    auto bins = make_histogram(in.numbers, in.bin_count);
+    show_histogram_text(bins, in.numbers);
     return 0;
 }
\ No newline at end of file