From c079f176b9c97cf788cc84bd133ebeade2e69e02 Mon Sep 17 00:00:00 2001 From: DevyatovaMY Date: Mon, 15 Apr 2024 16:13:18 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D0=B2=D1=8B=D0=BD=D0=BE=D1=81=20=D1=80?= =?UTF-8?q?=D0=B0=D1=81=D1=87=D1=91=D1=82=D0=B0=20=D0=B3=D0=B8=D1=81=D1=82?= =?UTF-8?q?=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B=20=D0=B2=20=D0=BE?= =?UTF-8?q?=D1=82=D0=B4=D0=B5=D0=BB=D1=8C=D0=BD=D1=8B=D0=B9=20=D1=84=D0=B0?= =?UTF-8?q?=D0=B9=D0=BB?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- histogram.cpp | 50 ++++++++++++++++++++++++++++++++++++++++++++++++++ histogram.h | 9 +++++++++ 2 files changed, 59 insertions(+) create mode 100644 histogram.cpp create mode 100644 histogram.h diff --git a/histogram.cpp b/histogram.cpp new file mode 100644 index 0000000..4d33c05 --- /dev/null +++ b/histogram.cpp @@ -0,0 +1,50 @@ +#include "histogram.h" + +using namespace std; + +static void +find_minmax(const vector& numbers, double& min, double& max) +{ + min = numbers[0]; + max = numbers[0]; + for (double x : numbers) + { + if (x > max ) + { + max = x; + } + if (x < min) + { + min = x; + } + } +} + +vector +make_histogram(const vector& numbers, size_t& bin_count) +{ + double min = 0; + double max = 0; + find_minmax(numbers, min, max); + auto bin_size = (max - min)/bin_count; + vector bins(bin_count); + for (double number : numbers) + { + 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 <= number) && (number < 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..cb3c148 --- /dev/null +++ b/histogram.h @@ -0,0 +1,9 @@ +#ifndef HISTOGRAM_H_INCLUDED +#define HISTOGRAM_H_INCLUDED + +#include + +std::vector +make_histogram(const std::vector& numbers, size_t& bin_count); + +#endif // HISTOGRAM_H_INCLUDED