From 08604a10d6053c3119aa025db373cafccd9c58ed Mon Sep 17 00:00:00 2001
From: "Dima (LekomtsevDO)" <LekomtsevDO@mpei.ru>
Date: Sat, 3 May 2025 14:22:06 +0300
Subject: [PATCH] =?UTF-8?q?3.=20=D1=80=D0=B0=D0=B7=D0=B4=D0=B5=D0=BB=D0=B5?=
 =?UTF-8?q?=D0=BD=D0=B8=D0=B5=20=D0=BD=D0=B0=20=D1=84=D0=B0=D0=B9=D0=BB?=
 =?UTF-8?q?=D1=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 histogram.cpp | 50 ++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 50 insertions(+)
 create mode 100644 histogram.cpp

diff --git a/histogram.cpp b/histogram.cpp
new file mode 100644
index 0000000..c9e16c3
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,50 @@
+#include "histogram.h"
+#include "histogram_internal.h"
+
+using namespace std;
+
+void find_minmax(const 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;
+        }
+    }
+}
+
+
+vector<size_t> make_histogram(const vector<double> &numbers, size_t bin_count)
+{
+    double min, max;
+    find_minmax(numbers, min, max);
+    double bin_size = (max - min) / bin_count;
+    vector <size_t> bins (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++)
+        {
+            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;
+}