From 188aeb61ba9fdeb328b6d892b3a1e1f4107f43da Mon Sep 17 00:00:00 2001
From: Anastasia <BogoslovAN@mpei.ru>
Date: Mon, 13 Oct 2025 18:28:48 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D1=83=D0=B4=D0=B0=D0=BB=D0=B5=D0=BD?=
 =?UTF-8?q?=D0=B8=D0=B5=20=D0=BA=D0=BE=D0=B4=D0=B0,=20=D0=BF=D0=B5=D1=80?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B5=D1=81=D0=B5=D0=BD=D0=BD=D0=BE=D0=B3=D0=BE=20?=
 =?UTF-8?q?=D0=B2=20=D0=B4=D1=80=D1=83=D0=B3=D0=B8=D0=B5=20=D1=84=D0=B0?=
 =?UTF-8?q?=D0=B9=D0=BB=D1=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 lab01/lab01.cpp | 63 -------------------------------------------------
 1 file changed, 63 deletions(-)

diff --git a/lab01/lab01.cpp b/lab01/lab01.cpp
index bbb7b7f..b4d9a48 100644
--- a/lab01/lab01.cpp
+++ b/lab01/lab01.cpp
@@ -22,69 +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;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
-    int maxlen = 0;
-
-    for (int j = 0; j < bucket; j++)
-    {
-        if (maxlen < stolb[j]) maxlen = stolb[j];
-    }
-
-    for (int j = 0; j < bucket; j++)
-    {
-        if (stolb[j] < 100) cout << " ";
-        if (stolb[j] < 10) cout << " ";
-        cout << stolb[j] << "|";
-        size_t height = stolb[j];
-        if (maxlen > MAX_ASTERISK)
-        {
-            if (maxlen != stolb[j]) height = MAX_ASTERISK * (static_cast <float> (stolb[j]) / maxlen);
-            else if (maxlen == stolb[j]) height = MAX_ASTERISK;
-        }
-        for (int i = 0; i < height; i++) cout << "*";
-        cout << "\n";
-    }
-}
-
-
 int main()
 {