From 62fd0546ce2deec3a783dffbe7cc84fa5eb71d14 Mon Sep 17 00:00:00 2001
From: BezhenarAN <bezhenaran@mpei.ru>
Date: Tue, 23 Apr 2024 18:36:26 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=BF=D1=83=D0=BD=D0=BA=D1=82=204.2(?=
 =?UTF-8?q?=D0=9F=D0=B5=D1=80=D0=B5=D0=BD=D0=BE=D1=81=20=D0=BE=D0=BF=D1=80?=
 =?UTF-8?q?=D0=B5=D0=B4=D0=B5=D0=BB=D0=B5=D0=BD=D0=B8=D1=8F=20find=5Fminma?=
 =?UTF-8?q?x()=20=D0=B8=20make=5Fhistogram())?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 histogram.cpp | 37 +++++++++++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)

diff --git a/histogram.cpp b/histogram.cpp
index e69de29..6744741 100644
--- a/histogram.cpp
+++ b/histogram.cpp
@@ -0,0 +1,37 @@
+#include "histogram.h"
+#include <vector>
+
+static void find_minmax(const std::vector <double> &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<std::size_t> make_histogram(const std::vector<double> &numbers, size_t bin_count) {
+    double min = numbers[0];
+    double max = numbers[0];
+    find_minmax(numbers, min, max);
+    double bin_size = ( max - min ) / bin_count;
+    std::vector<std::size_t> 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;
+}