From 26676bc577e6d610482751920762f7fdfd2e4134 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=C2=89Ivan=20=28BelaginIA=29?= <BelaginIA@mpei.ru>
Date: Mon, 27 Oct 2025 03:48:24 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D1=81=D1=82=D1=80=D1=83=D0=BA=D1=82?=
 =?UTF-8?q?=D1=83=D1=80=D0=B8=D1=80=D0=BE=D0=B2=D0=B0=D0=BD=D0=B8=D0=B5?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 43 ++++++++++++++++++++++++++++++++++++++++---
 1 file changed, 40 insertions(+), 3 deletions(-)

diff --git a/main.cpp b/main.cpp
index df8e157..96b9d10 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,8 +1,5 @@
 #include <iostream>
 #include <vector>
-#include "histogram.h"
-#include "histogram.cpp"
-
 
 using namespace std;
 
@@ -30,6 +27,46 @@ input_data() {
     return in;
 }
 
+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, double max) {
+    vector<size_t> bins(bin_count);
+
+    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;
+}
+
+
 
 void
 show_histogram_text(const vector<size_t>& bins) {