From 5feffafb4eaaa1d954f0aa138dfa6ecf6c79a9e7 Mon Sep 17 00:00:00 2001
From: ChernyukVS <vikktoriachernyuk@gmail.com>
Date: Tue, 16 Sep 2025 17:53:22 +0000
Subject: [PATCH] =?UTF-8?q?=D0=97=D0=B0=D0=B3=D1=80=D1=83=D0=B7=D0=B8?=
 =?UTF-8?q?=D0=BB(=D0=B0)=20=D1=84=D0=B0=D0=B9=D0=BB=D1=8B=20=D0=B2=20''?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/histogram.cpp b/histogram.cpp
new file mode 100644
index 0000000..208629d
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,57 @@
+#include "histogram.h"
+
+using namespace std;
+bool
+find_minmax(const std::vector<double> numbers, double& min, double& max)
+{
+    if(numbers.empty())
+    {
+        return false;
+    }
+    min = numbers[0];
+     max = numbers[0];
+    for (double x : numbers)
+    {
+        if (x < min)
+        {
+            min = x;
+        }
+        else if (x > max)
+        {
+            max = x;
+        }
+    }
+
+    return true;
+}
+
+std::vector<size_t> make_histogram(const std::vector<double> &numbers, size_t bin_count)
+{
+    std::vector<size_t> bins(bin_count);
+
+    double min, max;
+    if (!find_minmax(numbers, min, max)) {
+
+        return bins;
+    }
+
+    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++) {
+            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;
+}