From 9628dec71f3914dcddc44c81bd1d448e0a1ea3dc Mon Sep 17 00:00:00 2001
From: KhokhlovKR <KhokhlovKR@mpei.ru>
Date: Mon, 24 Apr 2023 23:10:36 +0300
Subject: [PATCH] =?UTF-8?q?code:=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D1=8F?=
 =?UTF-8?q?=20=D0=B2=D1=8B=D0=B2=D0=BE=D0=B4=D0=B0=20=D0=B3=D0=B8=D1=81?=
 =?UTF-8?q?=D1=82=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B=20=D0=BF=D0=BE?=
 =?UTF-8?q?=D0=B4=207=20=D0=B2=D0=B0=D1=80=D0=B8=D0=B0=D0=BD=D1=82?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/laba1cb/lab1final/histogram.cpp b/laba1cb/lab1final/histogram.cpp
new file mode 100644
index 0000000..c50f5e6
--- /dev/null
+++ b/laba1cb/lab1final/histogram.cpp
@@ -0,0 +1,54 @@
+#include <iostream>
+#include <cmath>
+#include <vector>
+#include "histogram.h"
+using namespace std;
+void
+find_minmax(const vector<double>& numbers, double &min, double &max)
+{
+
+    min = numbers[0];
+    max = numbers[0];
+    for (size_t i = 0; i < numbers.size(); i++)
+    {
+        if (numbers[i] > max)
+            max = numbers[i];
+        if (numbers[i] < min)
+            min = numbers[i];
+    }
+}
+
+vector <size_t> make_histogram (const vector<double>& numbers, size_t &bin_count)
+{
+   vector <size_t> bins(bin_count);
+
+   double min, max;
+   float low, hi;
+
+   find_minmax(numbers, min, max);
+
+   double bin_size = (max - min) / bin_count;
+   low = min;
+    hi = low + bin_size;
+
+    for (size_t i = 0; i < numbers.size(); i++)
+    {
+        bool found = false;
+
+        for (size_t j = 0; (j < bin_count - 1) && !found; j++)
+        {
+            low = min + j * bin_size;
+            hi = min + (j + 1) * bin_size;
+            if ((low <= numbers[i]) && (numbers[i] < hi))
+            {
+                bins[j]++;
+                found = true;
+            }
+        }
+        if (found==false)
+        {
+            bins[bin_count - 1]++;
+        }
+    }
+    return bins;
+}