From 0b9e56cf894b0480e1920b209d29876e4440d213 Mon Sep 17 00:00:00 2001
From: ShinkarenkoVA <shinkarenkova@mpei.ru>
Date: Wed, 8 May 2024 15:56:35 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B8=D0=B7=D0=BC=D0=B5=D0=BD=D0=B8?=
 =?UTF-8?q?=D0=BB=D0=B8=20=D1=82=D0=B8=D0=BF=20=D0=B8=20=D1=82=D0=B5=D0=BB?=
 =?UTF-8?q?=D0=BE=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B8?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 histogram.cpp | 16 ++++++++++++----
 1 file changed, 12 insertions(+), 4 deletions(-)

diff --git a/histogram.cpp b/histogram.cpp
index 18b418e..4ff2fa7 100644
--- a/histogram.cpp
+++ b/histogram.cpp
@@ -2,14 +2,20 @@
 #include <conio.h>
 #include <vector>
 #include <stdlib.h>
-using namespace std;
 #include "histogram.h"
 
-void
+using namespace std;
+
+bool
 find_minmax(const vector<double>& numbers, double& min, double& max){
+    if (numbers.empty()){
+        return false;
+    }
+
     min = numbers[0];
-    min = numbers[0];
-    for(size_t i=0; i < numbers.size(); i++){
+    max = numbers[0];
+    for(size_t i=0; i < numbers.size(); i++)
+    {
         if (numbers[i] < min)
         {
             min = numbers[i];
@@ -19,6 +25,8 @@ find_minmax(const vector<double>& numbers, double& min, double& max){
             max = numbers[i];
         }
     }
+
+    return true;
 }