From 2b4a50f23289e2f2c6b70ae8dba08ae45bea1dd1 Mon Sep 17 00:00:00 2001
From: "Bob (ZharkovIG)" <ZharkovIG@mpei.ru>
Date: Sat, 19 Oct 2024 16:07:18 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=94=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B0=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D1=8F?=
 =?UTF-8?q?=20=D0=BF=D0=BE=D0=B8=D1=81=D0=BA=D0=B0=20=D0=BC=D0=B0=D0=BA?=
 =?UTF-8?q?=D1=81=D0=B8=D0=BC=D1=83=D0=BC=D0=B0=20=D0=B8=20=D0=BC=D0=B8?=
 =?UTF-8?q?=D0=BD=D0=B8=D0=BC=D1=83=D0=BC=D0=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 55 +++++++++++++++++++++----------------------------------
 1 file changed, 21 insertions(+), 34 deletions(-)

diff --git a/main.cpp b/main.cpp
index 6470052..ce8b772 100644
--- a/main.cpp
+++ b/main.cpp
@@ -30,23 +30,11 @@ input_data(){
 
 }
 
-int
-main()
-{
-    Input in = input_data();
-
-    size_t i, bin;
-    //size_t number_count, bin_count, i, bin;
-    //cout << "Enter number count: " << endl;
-    //cin>>number_count;
-    //vector<double> numbers(number_count);
-    //cout<< "Enter numbers: "<<endl;
-    //for (size_t i = 0; i < number_count; i++){
-    //    cin>>numbers[i];
-    //}
-    double min = numbers[0];
-    double max = numbers[0];
-    for (double x : numbers) {
+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;
         }
@@ -54,13 +42,22 @@ main()
             max = x;
         }
     }
+}
 
-    //cout<< "Enter bin count: "<<endl;
-    //cin>>bin_count;
-    vector<size_t> bins(bin_count);
-    double bin_size = (max - min) / bin_count;
 
-    for (size_t i = 0; i < number_count; i++) {
+int
+main()
+{
+    Input in = input_data();
+
+    //size_t i, bin;
+    double min, max;
+    find_minmax(in.numbers, min, max);
+
+   // vector<size_t> bins(bin_count);
+    //double bin_size = (max - min) / bin_count;
+
+    /*for (size_t i = 0; i < number_count; i++) {
         bool found = false;
         for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
             auto lo = min + j * bin_size;
@@ -79,17 +76,7 @@ main()
     for (i = 0; i < bin_count; i++){
         if (bins[i] > max_count) max_count = bins[i];
     }
-    /*for(size_t bin:bins){
-        size_t height = bin;
-        height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
-        if(bin<100) cout<<" ";
-        if(bin<10) cout<<" ";
-        cout<<bin<<"|";
-        for(size_t i = 0; i < height; i++){
-            cout<<"*";
-        }
-        cout<<endl;
-    }*/
+
     for(size_t bin:bins){
         size_t height = bin;
         height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
@@ -100,6 +87,6 @@ main()
         if(bin<100) cout<<" ";
         if(bin<10) cout<<" ";
         cout<<bin<<endl;
-    }
+    }*/
     return 0;
 }