From 6c2a1b4981a7922b730374705904114ea13c309f Mon Sep 17 00:00:00 2001
From: MokeevNV <MokeevNV@mpei.ru>
Date: Thu, 1 May 2025 15:24:33 +0300
Subject: [PATCH] =?UTF-8?q?code:=203.=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(main)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 77 ++------------------------------------------------------
 1 file changed, 2 insertions(+), 75 deletions(-)

diff --git a/main.cpp b/main.cpp
index 168b61f..e66c587 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,5 +1,5 @@
-#include <iostream>
-#include <vector>
+#include "histogram.h"
+#include "text.h"
 
 using namespace std;
 
@@ -26,79 +26,6 @@ Input 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) {
-    vector<size_t> bins(bin_count);
-    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++) {
-            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){
-    //поиск максимального количества чисел в корзине
-    size_t max_count = 0;
-    for (double x : bins){
-        if (x > max_count){
-            max_count = x;
-        }
-    }
-    //константы для масштабирования
-    const size_t SCREEN_WIDTH = 80;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
-    //вывод
-    for (size_t i = 0;i < bins.size();i++){
-        if (bins[i] < 100){
-            cout << " ";
-        }
-        if (bins[i] < 10){
-            cout << " ";
-        }
-        cout << bins[i] << "|";
-        if (max_count > MAX_ASTERISK){
-            size_t height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
-            for (size_t j = 0;j < height;j++){
-                cout << "*";
-            }
-        }
-        else{
-            for (size_t j = 0;j < bins[i];j++){
-                cout << "*";
-            }
-        }
-        cout << endl;
-     }
-}
-
 int main() {
     auto in = input_data();
     auto bins = make_histogram(in.numbers, in.bin_count);