From 55459743b77736137632b80a84ca9664e8e5cc94 Mon Sep 17 00:00:00 2001
From: "Alice (KasimovAM)" <KasimovAM@mpei.ru>
Date: Sun, 28 May 2023 20:38:20 +0400
Subject: [PATCH] =?UTF-8?q?built:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B8=D0=B5=20histogram=20=D0=B8=20text=20cpp,h?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 histogram.cpp | 55 +++++++++++++++++++++++++++++++++++++++++++++++++++
 histogram.h   |  7 +++++++
 text.cpp      | 53 +++++++++++++++++++++++++++++++++++++++++++++++++
 text.h        |  4 ++++
 4 files changed, 119 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..f18a01b
--- /dev/null
+++ b/histogram.cpp
@@ -0,0 +1,55 @@
+#include "histogram.h"
+#include <iostream>
+#include <vector>
+using namespace std;
+
+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;
+        }
+        else if (x > max)
+        {
+            max = x;
+        }
+    }
+    return;
+}
+
+vector<size_t> make_histogram (vector<double> numbers, size_t bin_count)
+{
+
+    double min;
+    double max;
+    find_minmax (numbers, min, max);
+    double bin_size = (max - min) / bin_count;
+    vector<size_t> bins(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]) && (numbers[i] < hi))
+            {
+                bins[j]++;
+                found = true;
+            }
+        }
+
+        if (!found)
+        {
+            bins[bin_count - 1]++;
+        }
+    }
+
+    return bins;
+}
+
diff --git a/histogram.h b/histogram.h
new file mode 100644
index 0000000..c55d5f0
--- /dev/null
+++ b/histogram.h
@@ -0,0 +1,7 @@
+#ifndef HISTOGRAM_H_INCLUDED
+#define HISTOGRAM_H_INCLUDED
+#include <vector>
+using namespace std;
+vector<size_t>
+make_histogram(const 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..5ae4546
--- /dev/null
+++ b/text.cpp
@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+#include "text.h"
+using namespace std;
+
+void show_histogram_text(vector<size_t> bins, size_t bin_count)
+{
+    const size_t screen_width = 80;
+    const size_t max_asterisk = screen_width - 3 - 1;
+    size_t i,j;
+    double max_count;
+    max_count = bins[0];
+    for (i=0; i< bin_count; i++)
+    {
+        if (max_count<bins[i])
+        {
+            max_count=bins[i];
+        }
+    }
+
+    size_t height;
+    bool flag = false;
+    if(max_count>max_asterisk)
+    {
+        flag=true;
+    }
+    for (j = 0; j < bin_count; j++)
+    {
+        if (bins[j] < 100)
+        {
+            cout << " ";
+        }
+        if (bins[j] < 10)
+        {
+            cout << " ";
+        }
+        cout << bins[j] << "|";
+
+        if (flag)
+        {
+            height = max_asterisk * (static_cast<double>(bins[j]) / max_count);
+        }
+        else
+        {
+            height=bins[j];
+        }
+        for (i = 0; i < height; i++)
+        {
+            cout << "*";
+        }
+        cout << endl;
+    }
+}
diff --git a/text.h b/text.h
new file mode 100644
index 0000000..2e6e5fb
--- /dev/null
+++ b/text.h
@@ -0,0 +1,4 @@
+#ifndef TEXT_H_INCLUDED
+#define TEXT_H_INCLUDED
+void show_histogram_text(std::vector<size_t> bins, size_t bin_count);
+#endif // TEXT_H_INCLUDED