From c8dddb97de395dfa26621bc384665a0bb93c5865 Mon Sep 17 00:00:00 2001
From: "lab01(PokhilAA)" <PokhilAA@mpei.ru>
Date: Sun, 5 May 2024 16:31:22 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D1=84=D0=B0=D0=B9=D0=BB=20=D1=80=D0=B5?=
 =?UTF-8?q?=D0=B0=D0=BB=D0=B8=D0=B7=D0=B0=D1=86=D0=B8=D0=B81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/histogram.cpp b/histogram.cpp
new file mode 100644
index 0000000..71dc381
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,43 @@
+#include "histogram.h"
+#include <vector>
+#include <iostream>
+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;
+        }
+    }
+}
+
+std::vector<double>
+make_histogram(const std::vector<double>& numbers, size_t bin_count){
+    vector<double> bins (bin_count);
+
+    double min = 0, max = 0;
+    find_minmax(numbers, min, max);
+
+    double bin_size = (max - min) / bin_count;
+    for (int i = 0; i < numbers.size(); i++) {
+            bool found = false;
+            for (int 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;
+}