From bbd1176de85fcdb53690f884465c60e7449ee327 Mon Sep 17 00:00:00 2001
From: "Lab1 (ChaginSA)" <ChaginSA@mpei.ru>
Date: Sun, 28 May 2023 17:50:51 +0300
Subject: [PATCH] =?UTF-8?q?=D1=84=D0=B8=D0=BD=D0=B0=D0=BB=D1=8C=D0=BD?=
 =?UTF-8?q?=D0=B0=D1=8F=20=D0=B2=D0=B5=D1=80=D1=81=D0=B8=D1=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/histogram.cpp b/histogram.cpp
new file mode 100644
index 0000000..8596818
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,51 @@
+#pragma once
+
+#include <iostream>
+#include <vector>
+
+#include "histogram.h"
+
+using namespace std;
+
+
+
+void find_minmax(vector <double> numbers, double& min, double& max) {
+    min = numbers[0];
+    max = numbers[0];
+    for (int i = 0; i < numbers.size(); i++){
+        if (numbers[i] < min)
+                    min = numbers[i];
+        if (numbers[i] > max)
+                    max = numbers[i];
+
+
+}
+}
+
+vector<size_t> make_histogram(  vector<double> numbers,  size_t bin_count){
+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;
+}
+