From 305588566130148eca15c40d8436e87f8145cfc3 Mon Sep 17 00:00:00 2001
From: KuzmenkoEA <KuzmenkoYA@mpei.ru>
Date: Sun, 5 May 2024 23:34:35 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D1=80=D0=B0=D0=B7=D0=B4=D0=B5=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B8=D0=B5=20=D0=BF=D1=80=D0=BE=D0=B3=D1=80=D0=B0?=
 =?UTF-8?q?=D0=BC=D0=BC=D1=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 histogram.cpp | 52 ++++++++++++++++++++++++++-------------------------
 1 file changed, 27 insertions(+), 25 deletions(-)

diff --git a/histogram.cpp b/histogram.cpp
index 07d0436..727ee67 100644
--- a/histogram.cpp
+++ b/histogram.cpp
@@ -1,38 +1,40 @@
 #include "histogram.h"
 #include <vector>
+#include <iostream>
+using namespace std;
 
 void
-find_minmax(const std::vector<double> numbers, double& min, double& max) {
+find_minmax(const std::vector<double>& numbers, double& min, double& max) {
     min = numbers[0];
     max = numbers[0];
     for (double x : numbers)
-    {
-
-        if(x < min){min = x;}
-        else if (x > max){max = x;}
-    }
-    }
+        {
+            if (x < min) {min = x;}
+            else if (x > max) {max = x;}
+        }
+}
 
-std::vector<size_t>
-make_histogram(const std::vector<double>& numbers, size_t bin_count){
-    std::vector<size_t> bins(bin_count);
-    double min = 0;
-    double max = 0;
+std::vector<double>
+make_histogram(const std::vector<double>& numbers, size_t bin_count)
+{
+    std::vector<double> bins (bin_count);
+    double min = 0, max = 0;
     find_minmax(numbers, min, max);
     double bin_size = (max - min) / bin_count;
-    for (size_t i =0; i < numbers.size(); i++)
-    {
-        bool found = false;
-        for (size_t j = 0; (j < bin_count - 1) && !found; j++)
+    for (int i = 0; i < numbers.size(); i++)
         {
-            auto lo = min + j * bin_size;
-            auto hi = min + (j+1) * bin_size;
-            if ((lo <= numbers[i]) && (numbers[i] < hi))
+            bool found = false;
+            for (int j = 0; (j < bin_count - 1) && !found; j++)
             {
-                bins[j]++;
-                found = true;
-            }}
-        if (!found){bins[bin_count - 1]++;}
-    }
+                auto lo = min + j * bin_size;
+                auto hi = min + (j + 1) * bin_size;
+                if ((lo <= numbers[i]) && (numbers[i] < hi))
+                {
+                    bins[j]++;
+                    found = true;
+                }
+            }
+            if (!found) {bins[bin_count - 1]++;}
+        }
     return bins;
-    }
+}