From fc952b80bc7ca32a429aa7e6e2590e7741f70cf8 Mon Sep 17 00:00:00 2001
From: "Nikolay (KrivobokovNS)" <KrivobokovNS@mpei.ru>
Date: Wed, 3 Sep 2025 22:38:58 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B0=20=D0=BF=D1=80=D0=BE=D0=B2=D0=B5=D1=80=D0=BA?=
 =?UTF-8?q?=D0=B0=20=D0=BD=D0=B0=20=D0=BF=D1=83=D1=81=D1=82=D0=BE=D0=B9=20?=
 =?UTF-8?q?=D0=B2=D0=B5=D0=BA=D1=82=D0=BE=D1=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 histogram.cpp | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/histogram.cpp b/histogram.cpp
index 0357ff4..b55f283 100644
--- a/histogram.cpp
+++ b/histogram.cpp
@@ -3,6 +3,12 @@
 #include "histogram.h"
 
 void find_minmax(const std::vector<double>& numbers, double& min, double& max) {             //  Поиск максимума и минимума среди оценок.
+
+    if (numbers.empty()) {
+        min=max=0;
+        return;
+    }
+
     min=numbers[0];
     max=numbers[0];
     for (double x : numbers) {
@@ -19,13 +25,18 @@ void find_minmax(const std::vector<double>& numbers, double& min, double& max) {
 }
 
 std::vector<size_t> make_histogram(const std::vector<double>& numbers, size_t bin_count) {
+    std::vector<size_t> bins(bin_count);
+    if (numbers.empty() || bin_count == 0) {
+        return bins;
+    }
+
     double min, max;
     find_minmax(numbers, min, max);
 
 //  Создание корзин для дальнейшей сортировки оценок по ним.
 
     double bin_size = (max - min) / bin_count;
-    std::vector<size_t> bins(bin_count);
+
     for (size_t i = 0; i < bin_count; i++) {
         bins[i] = 0;
     }