From 27139b992d090c3022b682f920b5d619d400fb63 Mon Sep 17 00:00:00 2001 From: "Nikolay (KrivobokovNS)" Date: Thu, 21 Aug 2025 13:43:30 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D1=84=D0=B0=D0=B9=D0=BB=20=D1=81=20?= =?UTF-8?q?=D0=BA=D0=BE=D0=B4=D0=BE=D0=BC=20=D0=B3=D0=B8=D1=81=D1=82=D0=BE?= =?UTF-8?q?=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- histogram.cpp | 50 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 histogram.cpp diff --git a/histogram.cpp b/histogram.cpp new file mode 100644 index 0000000..0357ff4 --- /dev/null +++ b/histogram.cpp @@ -0,0 +1,50 @@ +#include +#include +#include "histogram.h" + +void find_minmax(const std::vector& numbers, double& min, double& max) { // Поиск максимума и минимума среди оценок. + min=numbers[0]; + max=numbers[0]; + for (double x : numbers) { + if (xmax) { + max=x; + } + } + } + + return; +} + +std::vector make_histogram(const std::vector& numbers, size_t bin_count) { + double min, max; + find_minmax(numbers, min, max); + +// Создание корзин для дальнейшей сортировки оценок по ним. + + double bin_size = (max - min) / bin_count; + std::vector bins(bin_count); + for (size_t i = 0; i < bin_count; i++) { + bins[i] = 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 = 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; +}