From e22859b6ebbafec20d5034bf3ef8856a1c014639 Mon Sep 17 00:00:00 2001
From: KhnytchenkovAM <KhnytchenkovAM@mpei.ru>
Date: Sun, 23 Apr 2023 18:56:10 +0300
Subject: [PATCH] =?UTF-8?q?=D0=9F=D1=83=D0=BD=D0=BA=D1=82=204=20=D0=B8?=
 =?UTF-8?q?=D1=81=D1=82?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 histogram.cpp | 48 ++++++++++++++++++++++++++++++++++++++++++++++++
 histogram.h   |  6 ++++++
 text.cpp      | 41 +++++++++++++++++++++++++++++++++++++++++
 text.h        |  6 ++++++
 4 files changed, 101 insertions(+)
 create mode 100644 histogram.cpp
 create mode 100644 histogram.h
 create mode 100644 text.cpp
 create mode 100644 text.h

diff --git a/histogram.cpp b/histogram.cpp
new file mode 100644
index 0000000..d437f30
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,48 @@
+#include "histogram.h"
+#include <iostream>
+#include <vector>
+using namespace std;
+void find_minmax( const vector<double>& numbers, double& minN, double& maxN) {
+    minN = numbers[0];
+    maxN = numbers[0];
+
+    for (double x: numbers){
+        if (minN > x){
+            minN = x;
+        }
+        if (maxN < x){
+            maxN = x;
+        }
+    }
+
+}
+
+vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count){
+    double minN, maxN;
+    find_minmax( numbers, minN, maxN);
+
+    vector <size_t> bins(bin_count);
+    double diff = (maxN - minN) / bin_count;
+    size_t max_count = 0;
+    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 = minN + j * diff;
+            auto hi = minN + (j + 1) * diff;
+            if ((lo <= numbers[i]) && (hi > numbers[i])){
+                bins[j]++;
+                if (bins[j] > max_count){
+                    max_count = bins[j];
+                }
+                found = true;
+            }
+        }
+        if(!found){
+            bins[bin_count - 1]++;
+            if (bins[bin_count - 1] > max_count){
+                    max_count = bins[bin_count - 1];
+            }
+        }
+}
+return bins;
+}
diff --git a/histogram.h b/histogram.h
new file mode 100644
index 0000000..7ceb169
--- /dev/null
+++ b/histogram.h
@@ -0,0 +1,6 @@
+#ifndef HISTOGRAM_H_INCLUDED
+#define HISTOGRAM_H_INCLUDED
+#include <vector>
+std::vector <size_t> make_histogram(const std::vector <double> &numbers, size_t bin_count);
+
+#endif // HISTOGRAM_H_INCLUDED
diff --git a/text.cpp b/text.cpp
new file mode 100644
index 0000000..08bf2ee
--- /dev/null
+++ b/text.cpp
@@ -0,0 +1,41 @@
+#include "text.h"
+#include <iostream>
+#include <vector>
+using namespace std;
+void show_histogram_text(const vector <size_t>& bins,size_t bin_count, size_t max_count){
+    const size_t SCREEN_WIDTH = 80;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 6 - 1;
+
+    bool scaling = false;
+
+    if (max_count > MAX_ASTERISK){
+        scaling = true;
+    }
+
+    for (size_t i = 0; i < bin_count; i++){
+        cout << "   ";
+        if (bins[i] < 100){
+            cout << ' ';
+        }
+        if (bins[i] < 10){
+            cout << ' ';
+        }
+        cout << bins[i] << '|';
+
+        size_t number_of_stars = bins[i];
+
+        if (scaling){
+            if (bins[i] == max_count){
+                number_of_stars = MAX_ASTERISK * 1.0;
+            }
+            else {
+                number_of_stars = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
+            }
+        }
+
+        for (size_t j = 0; j < number_of_stars; j++){
+            cout << '*';
+        }
+        cout << endl;
+    }
+}
diff --git a/text.h b/text.h
new file mode 100644
index 0000000..a619492
--- /dev/null
+++ b/text.h
@@ -0,0 +1,6 @@
+#ifndef TEXT_H_INCLUDED
+#define TEXT_H_INCLUDED
+#include <vector>
+void show_histogram_text(const std::vector <size_t>& bins,size_t bin_count, size_t max_count);
+
+#endif // TEXT_H_INCLUDED