From e30ff7800701076f3dec47af4882022acb78209d Mon Sep 17 00:00:00 2001
From: LyzhinAK <LyzhinAK@mpei.ru>
Date: Sun, 27 Apr 2025 15:56:27 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D1=80=D0=B0=D0=B7=D0=B4=D0=B5=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B8=D0=B5=20=D0=BF=D1=80=D0=BE=D0=B3=D1=80=D0=B0?=
 =?UTF-8?q?=D0=BC=D0=BC=D1=8B=20=D0=BD=D0=B0=20=D1=84=D0=B0=D0=B9=D0=BB?=
 =?UTF-8?q?=D1=8B=201?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 38 +-------------------------------------
 1 file changed, 1 insertion(+), 37 deletions(-)

diff --git a/main.cpp b/main.cpp
index 487ac3c..edd6ece 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,6 +1,6 @@
 #include <iostream>
 #include <vector>
-
+#include "histogram.h"
 
 using namespace std;
 
@@ -22,41 +22,6 @@ 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 bucket, size_t number_count) {
-    vector <size_t> stolb(bucket);
-    double min, max;
-    find_minmax (numbers, min, max);
-    float k = (max-min)/bucket;
-    for (size_t i = 0; i < bucket; i++) stolb[i] = 0;
-    for (size_t i = 0; i < number_count; i++)
-    {
-        bool flag = false;
-        for (size_t j = 0; (j < bucket && !flag); j++)
-        {
-            if (numbers[i] >= (min+k*j) && numbers[i] < (min+k*(1+j)))
-            {
-                stolb[j]++;
-                flag = true;
-
-            }
-        }
-        if (!flag) stolb[bucket-1]++;
-    }
-    return stolb;
-}
-
 void
 show_histogram_text(vector <size_t> stolb, size_t bucket) {
     const size_t SCREEN_WIDTH = 80;
@@ -83,7 +48,6 @@ show_histogram_text(vector <size_t> stolb, size_t bucket) {
         cout << "\n";
     }}
 
-
 int main()
 {