From 123602babef678009f32da3ee4fc0a7e072172c7 Mon Sep 17 00:00:00 2001
From: LyzhinAK <LyzhinAK@mpei.ru>
Date: Sun, 27 Apr 2025 15:57:46 +0300
Subject: [PATCH] =?UTF-8?q?build:=20=D1=84=D0=B0=D0=B9=D0=BB=20=D1=80?=
 =?UTF-8?q?=D0=B5=D0=B0=D0=BB=D0=B8=D0=B7=D0=B0=D1=86=D0=B8=D0=B8?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/histogram.cpp b/histogram.cpp
new file mode 100644
index 0000000..3b73eee
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,34 @@
+static void
+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;
+    }
+}
+
+std::vector <size_t>
+make_histogram(const std::vector<double>& numbers, size_t bucket, size_t number_count) {
+    std::vector <size_t> stolb(bucket);
+    double min, max;
+    find_minmax (numbers, min, max);
+    float k = (max-min)/bucket;
+    for (size_t i = 0; i < bucket; i++) stolb[i] = 0;
+    for (size_t i = 0; i < number_count; i++)
+    {
+        bool flag = false;
+        for (size_t j = 0; (j < bucket && !flag); j++)
+        {
+            if (numbers[i] >= (min+k*j) && numbers[i] < (min+k*(1+j)))
+            {
+                stolb[j]++;
+                flag = true;
+
+            }
+        }
+        if (!flag) stolb[bucket-1]++;
+    }
+    return stolb;
+}