From 43a6b254fa379ed9f686a76d2db9c63a5dbe3594 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=D0=90=D0=BB=D1=91=D0=BD=D0=B0=20=D0=90=D1=83=D0=BB=D0=BE?=
 =?UTF-8?q?=D0=B2=D0=B0?= <AulovaAV@mpei.ru>
Date: Sun, 4 Jun 2023 23:55:51 +0300
Subject: [PATCH] ggg

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

diff --git a/histogram.cpp b/histogram.cpp
new file mode 100644
index 0000000..beefd28
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,52 @@
+#include <iostream>
+#include <vector>
+#include "histogram.h"
+
+//std::vector<size_t>
+
+void
+find_minmax(const std::vector<double> numbers, double& min, double& max)
+{
+/*/double/*/ min = numbers[0];//поиск мин и макс
+/*/ double/*/ 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 bin_count)
+{
+std::vector <size_t> bins(bin_count);
+double min, max;
+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++)
+{
+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;
+}