From 0e045b574550447ec63be04417b4ee081f72ac51 Mon Sep 17 00:00:00 2001 From: unknown Date: Thu, 1 May 2025 17:41:25 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D1=81=D0=BE=D0=B7=D0=B4=D0=B0=D0=BD=20?= =?UTF-8?q?=D1=84=D0=B0=D0=B9=D0=BB=20=D1=80=D0=B5=D0=B0=D0=BB=D0=B8=D0=B7?= =?UTF-8?q?=D0=B0=D1=86=D0=B8=D0=B8?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- histogram.cpp | 109 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 109 insertions(+) create mode 100644 histogram.cpp diff --git a/histogram.cpp b/histogram.cpp new file mode 100644 index 0000000..e5c32e6 --- /dev/null +++ b/histogram.cpp @@ -0,0 +1,109 @@ +#include "histogram.h" + +static void find_minmax(const std::vector& 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; +} + +std::vector make_histogram(const std::vector& numbers, size_t& bin_count) { + double minn, maxn; + find_minmax(numbers, minn, maxn); + double bin_size = (maxn - minn) / bin_count; + std::vector bins(bin_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 * bin_size; + auto hi = minn + (j + 1) * bin_size; + if ((numbers[i] >= lo) && (numbers[i] <= hi)) { + bins[j]++; + found = true; + } + } + if (!found) { + bins[bin_count - 1]++; + } + } + return bins; +} + +void show_histogram_text(const std::vector bins, size_t bin_count) { + size_t max_count = bins[0]; + for (size_t i = 1; i < bin_count; i++) { + if (bins[i] > max_count) { + max_count = bins[i]; + } + } + + const size_t SCREEN_WIDTH = 80; + const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + + + short space_count; + + std::cerr << "\nHistogram:" << std::endl; + + if (max_count <= MAX_ASTERISK) { + for (size_t i = 0; i < bin_count; i++) { + if (bins[i] < 10) { + space_count = 2; + } else if (bins[i] >= 10 && bins[i] < 100) { + space_count = 1; + } else if (bins[i] >= 100 && bins[i] < 1000) { + space_count = 0; + } + + + + for (size_t k = 0; k < space_count; k++) { + std::cout << " "; + } + + std::cout << bins[i]; + + std::cout << "|"; + + + for (size_t j = 0; j < bins[i]; j++) { + std::cout << "*"; + } + + std::cout << "\n"; + } + } else { + for (size_t i = 0; i < bin_count; i++) { + if (bins[i] < 10) { + space_count = 2; + } else if (bins[i] >= 10 && bins[i] < 100) { + space_count = 1; + } else if (bins[i] >= 100 && bins[i] < 1000) { + space_count = 0; + } + + + for (size_t k = 0; k < space_count; k++) { + std::cout << " "; + } + + std::cout << bins[i]; + + std::cout << "|"; + + size_t height = static_cast(MAX_ASTERISK * (static_cast(bins[i]) / max_count)); + for (size_t j = 0; j < height; j++) { + std::cout << "*"; + } + + std::cout << "\n"; + } + } +}