From 2860a5cf81e9ba12c2f8be3423a4d679ae966985 Mon Sep 17 00:00:00 2001 From: KnyazevSK Date: Sun, 21 May 2023 23:30:07 +0400 Subject: [PATCH] =?UTF-8?q?build:=20=D0=B2=D1=8B=D0=B4=D0=B5=D0=BB=D0=B5?= =?UTF-8?q?=D0=BD=D0=B8=D0=B5=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B8?= =?UTF-8?q?=20make?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- histogram.cpp | 54 +++++++++++++++++++++++++++++++++++++++++++++++++++ histogram.h | 6 ++++++ 2 files changed, 60 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..5867495 --- /dev/null +++ b/histogram.cpp @@ -0,0 +1,54 @@ +#include "histogram.h" +#include +#include +using namespace std; + +void find_minmax(const 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; +} + +vector make_histogram (vector numbers, size_t bin_count) +{ + + double min; + double max; + find_minmax (numbers, min, max); + double bin_size = (max - min) / bin_count; + vector bins(bin_count); + + 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.h b/histogram.h new file mode 100644 index 0000000..c750551 --- /dev/null +++ b/histogram.h @@ -0,0 +1,6 @@ +#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