From 74483c5131e7f711bc62e1af46cfad5d1f22abcb Mon Sep 17 00:00:00 2001
From: KonovalovaAA <KonovalovaAlA@mpei.ru>
Date: Mon, 10 Apr 2023 15:00:09 +0300
Subject: [PATCH] code: input and find_minmax

---
 main.cpp | 123 +++++++++++++++++++------------------------------------
 1 file changed, 41 insertions(+), 82 deletions(-)

diff --git a/main.cpp b/main.cpp
index 13220fa..b1e5af4 100644
--- a/main.cpp
+++ b/main.cpp
@@ -3,99 +3,58 @@
 
 using namespace std;
 
-int main()
-{
-    const size_t SCREEN_WIDTH = 80;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
-    size_t number_count, bin_count, i, j;
-
-    cerr << "Enter number count: ";
-    cin >> number_count;
-
-
-    vector<double> numbers(number_count);
-
-    for (i=0; i<number_count; i++)
-    {
-        cin>>numbers[i];
-
-    }
-
-    cerr << "Enter bin_count: ";
-    cin >> bin_count;
-
-
-    vector<size_t> bins(bin_count);
-
-    double min = numbers[0];
-    double max = numbers[0];
-    for (double x : numbers)
-    {
-        if (x < min)
-        {
-            min = x;
-        }
-        else if (x > max)
-        {
-            max = x;
-        }
-    }
-
-    double bin_size = (max - min) / bin_count;
-
-    for (i = 0; i < number_count; i++)
+     void
+    find_minmax(vector<double> numbers, double& min, double& max) {
+    min = numbers[0];
+    max = numbers[0];
+    size_t number_count = numbers.size();
+    for (size_t i = 1; i < number_count; i++)
     {
-        bool found = false;
-        for (j = 0; (j < bin_count - 1) && !found; j++)
+        if (numbers[i] < min)
         {
-            auto lo = min + j * bin_size;
-            auto hi = min + (j + 1) * bin_size;
-            if ((lo <= numbers[i]) && (numbers[i] < hi))
-            {
-                bins[j]++;
-                found = true;
-            }
+            min = numbers[i];
         }
-        if (!found)
+        else if (numbers[i] > max)
         {
-            bins[bin_count - 1]++;
+            max = numbers[i];
         }
     }
+}
+ 
+	 
+	struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+};
+    Input
+    input_data()
+{
+	size_t number_count;
+cin >> number_count;
+    
 
-    size_t max_count = 76;
-
-    for (i=1; i<bin_count; i++)
-    {
-        if (bins[i] > max_count && bins[i] > 76)
-            max_count=bins[i];
-    }
+vector<double> numbers(number_count);
+for (size_t i = 0; i < number_count; i++) {
+    cin >> numbers[i];
+}
 
+size_t bin_count;
+cin >> bin_count;
 
-    //for (i=0; i<bins[bin_count-1]; i++)
-    {
-        //for (j=0; j<bin_count; j++)
-        {
-            //if (bins[j]>i)
-                //cout<<"*";
-            //else
-                //cout<<" ";
-        }
-        //cout<<endl;
+Input in;
+    in.numbers.resize(number_count);
+    
+        for (size_t i = 0; i < number_count; i++) {
+        cin >> in.numbers[i];
     }
+     cin >> in.bin_count;
+     return in;
 
+}
 
-    for(i=0; i<bin_count;i++){
-
-    if (bins[i]>=100)
-    cout<<bins[i]<<"|";
-    if (bins[i]<100 && bins[i]>=10)
-    cout<<" "<<bins[i]<<"|";
-    if (bins[i]<10)
-    cout<<"  "<<bins[i]<<"|";
-    size_t height = 76 * (static_cast<double>(bins[i]) / max_count);
-    for(j=0;j< height;j++)
-    cout<<"*";
-    cout<<endl;}
+int main()
+{
+   
+    Input in = input_data();
 
-    return 0;
 }