code: поиск минимума и максимума вынесен в функцию fing_minmax()

main.cpp

@@ -15,7 +15,7 @@ Input
 input_data(){
 
     size_t number_count;
-    cerr << "Enter number_count: "
+    cerr << "Enter number_count: ";
     cin >> number_count;
 
     Input in;
@@ -31,28 +31,10 @@ input_data(){
     return in;
 }
 
-int
+void
-main()
+find_minmax(vector<double>& numbers, double& min, double& max){
-{
+    min = numbers[0];
-    //size_t number_count, bin_count, max_count;
+    max = numbers[0];
-
-    //cerr << "Enter number count: ";
-    //cin >> number_count;
-
-    //vector<double> numbers(number_count);
-
-    //cerr << "Enter numbers: ";
-    //for (size_t i = 0; i < number_count; i++){
-        //cin >> numbers[i];
-    //}
-
-    //cerr << "Enter bin count: ";
-    //cin >> bin_count;
-
-
-
-    double min = numbers[0];
-    double max = numbers[0];
 
     for (double x : numbers) {
         if (x < min) {
@@ -62,72 +44,15 @@ main()
             max = x;
         }
     }
+}
 
-    vector<size_t> bins(bin_count);
+int
-    double bin_size = (max - min) / bin_count;
+main()
+{
+    Input in = input_data();
 
-    for (size_t i = 0; i < number_count; i++) {
+    double min, max;
-        bool found = false; // òåêóùåå ñîñòîÿíèå òåêóùåãî ýëåìåíòà. Ýëåìåíò íå ðàñïðåäåëåí â êîðçèíó
+    find_minmax(in.numbers, min, max);
-        for (size_t j = 0; (j < bin_count - 1) && !found; j++) { // áåð¸ì j-þ êîðçèíó
-            auto lo = min + j * bin_size; // îïðåäåëÿåì ãðàíèöû äàííîé êîðçèíû
-            auto hi = min + (j + 1) * bin_size;
-            if ((lo <= numbers[i]) && (numbers[i] < hi)) { // ïîäñòàâëÿåì ïîä ýòè ãðàíèöû i-é ýëåìåíò èç numbers
-                bins[j]++; // åñëè ýëåìåíò íàõîäèòñÿ â äàííîì äèàïàçîíå (ãðàíèöàõ), òî óâåëè÷èâàåì ñ÷åò÷èê j-îé êîðçèíû
-                found = true; // ïåðåêëþ÷àåì "ôëàæîê", ÷òîáû ïðåêðàòèòü ïåðåáîð êîðçèí è ïåðåéòè ê ñäåä. ýë. èç numbers
-            }                 // òî åñòü òåïåðü ýëåìåíò ðàñïðåäåëåí â êîðçèíó è íåò íóæäû ïåðåáèðàòü îñòàëüíûå êîðçèíû
-        }
-        if (!found) { // à åñëè æå âñ¸ òàêè ýë. íå ðàñïðåäåëåí, òî ýòî çíà÷èò, ÷òî îí ïîïàäàåò â ïîñëåäíèé äèàïàçîí
-            bins[bin_count - 1]++; // äîáàâëÿåì ýòîò ýë. â ïîñëåäíþþ êîðçèíó
-        }
-    }
 
-    // ïîäñ÷åò ìàêñèìàëüíîãî ðàçìåðà ñðåäè ðàçìåðîâ êîðçèí
-    max_count = 0;
-    for (size_t x: bins) {
-        if (x > max_count) {
-                max_count = x;
-        }
-    }
-
-    if (max_count > MAX_ASTERISK) {
-        for (size_t count: bins) {
-            size_t height = MAX_ASTERISK * (static_cast<double>(count) / max_count);
-            if (count < 10) {
-                cout << "  " << count << "|";
-            }
-            else if (count >= 100) {
-                cout << count << "|";
-            }
-
-            else {
-                cout << " " << count << "|";
-            }
-
-            for (size_t i = 0; i < height; i++) {
-                cout << "*";
-            }
-            cout << "\n";
-        }
-    }
-
-    else {
-        for (size_t x: bins) {
-            if (x < 10) {
-                cout << "  " << x << "|";
-            }
-            else if (x >= 100) {
-                cout << x << "|";
-            }
-
-            else {
-                cout << " " << x << "|";
-            }
-
-            for (size_t i = 0; i < x; i++) {
-                cout << "*";
-            }
-            cout << "\n";
-        }
-    }
     return 0;
 }