From 3bc5b7faf214e3ad746ebce91cd87789e904a9cd Mon Sep 17 00:00:00 2001 From: IvanovDA Date: Mon, 29 Apr 2024 01:10:55 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?= =?UTF-8?q?=D0=B5=D0=BD=D0=B8=D0=B5=20=D1=84=D0=B0=D0=B9=D0=BB=D0=B0=20?= =?UTF-8?q?=D0=B3=D0=B8=D1=81=D1=82=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D1=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- histogram.cpp | 47 +++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 histogram.cpp diff --git a/histogram.cpp b/histogram.cpp new file mode 100644 index 0000000..f23db86 --- /dev/null +++ b/histogram.cpp @@ -0,0 +1,47 @@ +#include +#include +#include "histogram.h" +using namespace std; + +void +find_minmax(const vector& numbers, double& min, double& max) { + min = numbers[0]; + for (size_t i = 1; i < numbers.size(); i++) { + if (numbers[i] < min) { + min = numbers[i]; + } + else if (numbers[i] > max) { + max = numbers[i]; + } + } +} + +vector +make_histogram(const vector & numbers, size_t bin_count) { + double minc, maxc; + find_minmax(numbers, minc, maxc); + vector bins(bin_count); + double bin_size = (maxc - minc) / bin_count; + size_t bin_max_size = 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 = minc + j * bin_size; + auto hi = minc + (j + 1) * bin_size; + if ((lo <= numbers[i]) && (numbers[i] < hi)) { + bins[j]++; + found = true; + if (bins[j] > bin_max_size) { + bin_max_size = bins[j]; + } + } + } + if (!found) { + bins[bin_count - 1]++; + if (bins[bin_count - 1] > bin_max_size) { + bin_max_size = bins[bin_count - 1]; + } + } + } + return bins; +} \ No newline at end of file