From 3cd7f0627b2bda0de1d54bed65bb64ee648f25c4 Mon Sep 17 00:00:00 2001 From: "Dima (LekomtsevDO)" Date: Mon, 28 Apr 2025 15:47:12 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D1=80=D0=B0=D0=B7=D0=B4=D0=B5=D0=BB?= =?UTF-8?q?=D0=B5=D0=BD=D0=B8=D0=B5=20=D0=BD=D0=B0=20=D0=BF=D0=BE=D0=B4?= =?UTF-8?q?=D0=BF=D1=80=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- main.cpp | 61 ++++++++++++++++++++++++++++++++++++++++++-------------- 1 file changed, 46 insertions(+), 15 deletions(-) diff --git a/main.cpp b/main.cpp index 7319326..dcae1e5 100644 --- a/main.cpp +++ b/main.cpp @@ -1,32 +1,39 @@ -#include #include +#include using namespace std; -int main() +struct Input { - size_t number_count,bin_count; - const size_t SCREEN_WIDTH = 80; - const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + vector numbers; + size_t bin_count{}; +}; +Input input_data() +{ + size_t number_count; cerr << "Enter number count: "; cin >> number_count; - + Input in; + in.numbers.resize(number_count); vector numbers(number_count); for (int i = 0; i < number_count; i++) { cerr << "Number[" << i << "]="; - cin >> numbers[i]; + cin >> in.numbers[i]; } - cerr << "Enter bin count: "; - cin >> bin_count; - vector bins(bin_count); + cerr << "Enter bin count: "; + cin >> in.bin_count; + return in; +} - double min = numbers[0]; - double max = numbers[0]; +void find_minmax(const vector &numbers, double &min, double &max) +{ + min = numbers[0]; + max = numbers[0]; for (double x : numbers) { if (x < min) @@ -38,16 +45,21 @@ int main() max = x; } } - +} +vector make_histogram(const vector &numbers, size_t bin_count) +{ + double min, max; + find_minmax(numbers, min, max); double bin_size = (max - min) / bin_count; + vector bins (bin_count); - for (size_t i = 0; i < number_count; i++) + 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; + auto hi = min + (j+1) * bin_size; if ((lo <= numbers[i]) && (numbers[i] < hi)) { bins[j]++; @@ -59,7 +71,13 @@ int main() bins[bin_count - 1]++; } } + return bins; +} +void show_histogram_text(const vector& bins, size_t& bin_count, double bin_size) +{ + const size_t SCREEN_WIDTH = 80; + const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; size_t max_bin_count = bins[0]; for(size_t i = 0; i < bin_count; i++) { @@ -106,5 +124,18 @@ int main() } cout<