From be9b2d8ae4345ac695380f18ea9fd89d24b7ac8a Mon Sep 17 00:00:00 2001
From: "PARZIVAL (BreganIM)" <BreganIM@mpei.ru>
Date: Mon, 14 Apr 2025 00:46:52 +0300
Subject: [PATCH] =?UTF-8?q?code:=D0=A4=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D1=8F?=
 =?UTF-8?q?=20=D1=80=D0=B0=D1=81=D1=87=D1=91=D1=82=D0=B0=20=D0=B3=D0=B8?=
 =?UTF-8?q?=D1=81=D1=82=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 laba01upd3.cpp | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)

diff --git a/laba01upd3.cpp b/laba01upd3.cpp
index 4487bde..c765b10 100644
--- a/laba01upd3.cpp
+++ b/laba01upd3.cpp
@@ -40,6 +40,29 @@ void find_minmax(const vector<double>& numbers, double& min, double& max) {
     }
 }
 
+vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count) {
+    vector<size_t> bins(bin_count, 0);
+    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++) {
+            double lo = min + j * bin_size;
+            double hi = min + (j + 1) * bin_size;
+            if (numbers[i] >= lo && numbers[i] < hi) {
+                bins[j]++;
+                found = true;
+            }
+        }
+        
+        if (!found)
+            bins[bin_count - 1]++;
+    }
+    return bins;
+}
 
 int main()
 {