From cf729299ca3a34f815152455f6a4c87c433cfe95 Mon Sep 17 00:00:00 2001 From: KuriloVA Date: Thu, 1 May 2025 18:09:06 +0300 Subject: [PATCH] =?UTF-8?q?=D0=BF=D1=83=D0=BD=D0=BA=D1=82=204:=20=D0=B4?= =?UTF-8?q?=D0=BE=D0=B1=D0=B0=D0=B2=D0=B8=D0=BB=D0=B0=20histogram.=D1=81pp?= =?UTF-8?q?=20=D0=B8=20=20histogram=5Finternal.h?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- histogram.cpp | 46 ++++++++++++++++++++++++++++++++++++++++++++ histogram_internal.h | 7 +++++++ 2 files changed, 53 insertions(+) create mode 100644 histogram.cpp create mode 100644 histogram_internal.h diff --git a/histogram.cpp b/histogram.cpp new file mode 100644 index 0000000..541ef48 --- /dev/null +++ b/histogram.cpp @@ -0,0 +1,46 @@ +#include "histogram.h" +#include + +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; + } + } +} + +std::vector +make_histogram(const std::vector& numbers, size_t bin_count) { + std::vector bins(bin_count, 0); + + double min, max; + find_minmax(numbers, min, max); + + double bin_size = (max - min) / bin_count; + if (bin_size == 0) { + bin_size = 1; + } + + 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_internal.h b/histogram_internal.h new file mode 100644 index 0000000..fa9075e --- /dev/null +++ b/histogram_internal.h @@ -0,0 +1,7 @@ +#ifndef HISTOGRAM_INTERNAL_H_INCLUDED +#define HISTOGRAM_INTERNAL_H_INCLUDED +#include +void find_minmax(const std::vector& numbers, double& min, double& max); + + +#endif // HISTOGRAM_INTERNAL_H_INCLUDED