From 48406dfbf6624615618667cdb063a827fe34af7b Mon Sep 17 00:00:00 2001
From: TarasovEE <TarasovYY@mpei.ru>
Date: Sun, 18 May 2025 20:11:07 +0300
Subject: [PATCH] =?UTF-8?q?source:=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=20=D1=84?=
 =?UTF-8?q?=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B8=20=D1=81=D0=BE=D0=B7=D0=B4?=
 =?UTF-8?q?=D0=B0=D0=BD=D0=B8=D1=8F=20=D0=BA=D0=BE=D1=80=D0=B7=D0=B8=D0=BD?=
 =?UTF-8?q?=20=D0=B3=D0=B8=D1=81=D1=82=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC?=
 =?UTF-8?q?=D1=8B=20=D0=B8=20=D0=BF=D0=BE=D0=B8=D1=81=D0=BA=D0=B0=20=D1=8D?=
 =?UTF-8?q?=D0=BA=D1=82=D1=80=D0=B5=D0=BC=D1=83=D0=BC=D0=B0=20=D0=B2=20?=
 =?UTF-8?q?=D0=BC=D0=B0=D1=81=D1=81=D0=B8=D0=B2=D0=B5?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/histogram.cpp b/histogram.cpp
new file mode 100644
index 0000000..7015072
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,54 @@
+#include "histogram.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 < bin_count; i++)
+        bins[i] = 0;
+
+//  Сортировка оценок по корзинам.
+
+    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;
+}