main.cpp

@@ -4,29 +4,53 @@
 #include <cstdio>
 
 using namespace std;
-struct Input {
-    vector<double> numbers;
-    size_t bin_count{};
-};
 
-void find_minmax(vector<double> numbers, double& min, double& max);
+void mmV(vector<double> numbers, double& min, double& max);
-//size_t maxBin(vector<size_t> bins);
+size_t maxBin(vector<size_t> bins);
-vector<size_t> make_histogram(vector<double> numbers, size_t bin_count);
-Input input_data();
 
 const size_t SCREEN_WIDTH = 80;
 const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
+struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+};
 
 int main()
 {
+
+    vector<size_t> bins;
+    size_t countOfNumbers;
     size_t maxCount;
-    Input in = input_data();
+    double max;
-    vector<size_t> bins = make_histogram(in.numbers,in.bin_count);
+    double min;
+
+    numbers.resize(countOfNumbers);
 
-    /*
+    cerr << endl;
+    cerr << "Input bin count:\n";
+    cin >> binCount;
+    bins.resize(binCount);
+    mmV(numbers, min, max);
+    double bin_size = (max - min) / binCount;
+
+
+    for (size_t i = 0; i < countOfNumbers; i++) {
+        bool found = false;
+        for (size_t j = 0; (j < binCount - 1) && !found; j++) {
+            auto lo = min + j * bin_size;
+            auto hi = min + (j + 1) * bin_size;
+            if ((lo <= numbers[i]) && (hi > numbers[i])) {
+                bins[j]++;
+                found = true;
+            }
+        }
+        if (!found) {
+            bins[binCount - 1]++;
+        }
+    }
     maxCount = maxBin(bins);
     size_t count_stars;
-    for (int i = 0; i < in.bin_count; i++) {
+    for (int i = 0; i < binCount; i++) {
 
         if (bins[i] < 100) {
             cout << " ";
@@ -51,11 +75,11 @@ int main()
 
 
     }
-    */
+
     return 0;
 }
 
-/*size_t maxBin(vector<size_t> bins) {
+size_t maxBin(vector<size_t> bins) { //ëó÷øå áåç ôóíêöèè
     size_t max = bins[0];
     for (int i = 1; i < bins.size(); i++) {
         if (max < bins[i]) {
@@ -63,8 +87,8 @@ int main()
         }
     }
     return max;
-}*/
+}
-void find_minmax(vector<double> numbers, double& min, double& max) {
+void mmV(vector<double> numbers, double& min, double& max) { //ñêàçàë ñäåëàòü áåç ôóíêöèè
     min = numbers[0];
     max = numbers[0];
     for (double number : numbers) {
@@ -79,49 +103,18 @@ void find_minmax(vector<double> numbers, double& min, double& max) {
 }
 
 
-Input input_data() {
+Input input_data(){
-    Input input_struct;
-    size_t countOfNumbers;
     cerr << "Input your count of numbers:\n";
+    Input input_struct;
     cin >> countOfNumbers;
-
-    input_struct.numbers.resize(countOfNumbers);
-
-    cerr << "Input bin count:\n";
-    cin >> input_struct.bin_count;
     cerr << "Input numbers:\n";
     for (int i = 0; i < countOfNumbers; i++) {
-        cerr << i << ":"<< endl;
+        cerr << i << endl;
-        cin >> input_struct.numbers[i];
+        cin >> numbers[i];
     }
-    cerr << endl;
-    return input_struct;
-}
 
-vector<size_t> make_histogram(vector<double> numbers, size_t bin_count)
-{
-    double max;
-    double min;
-    vector<size_t> bins;
-    bins.resize(bin_count);
-    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]) && (hi > numbers[i])) {
-                bins[j]++;
-                found = true;
-            }
-        }
-        if (!found) {
-            bins[bin_count - 1]++;
-        }
-    }
-    return bins;
 }
+//var15 áåç ìàñøòàáèðîâàíèÿ çàùèòà