From 637695da3a32b740dd0c9b4b8b9aa5683c3c8377 Mon Sep 17 00:00:00 2001 From: AulovaAV Date: Sun, 28 May 2023 19:27:24 +0300 Subject: [PATCH] =?UTF-8?q?=D0=B2=D1=81=D0=B5=20=D0=B8=D0=B7=D0=BC=D0=B5?= =?UTF-8?q?=D0=BD=D0=B5=D0=BD=D0=B8=D1=8F=20=D0=B4=D0=BE=20=D0=BF=D1=83?= =?UTF-8?q?=D0=BD=D0=BA=D1=82=D0=B0=204?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- main.cpp | 147 +++++++++++++++++++++++++++++++++++++++---------------- 1 file changed, 104 insertions(+), 43 deletions(-) diff --git a/main.cpp b/main.cpp index fd8a076..8f4aa90 100644 --- a/main.cpp +++ b/main.cpp @@ -1,60 +1,121 @@ #include #include + + using namespace std; -int main() -{ -size_t number_count; -cout << "Enter number count: "; -cin >> number_count; -vector numbers(number_count); -for(int i=0; i> bin_count; -double min = numbers[0]; -double max = numbers[0]; -for (double x : numbers) { -if (x < min) { -min = x; -} -else if (x > max) { -max = x; -} +const size_t SCREEN_WIDTH = 80; +const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + + +struct Input { + 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); + for(int i;i> in.numbers[i]; + } + cerr << "Enter bin count: "; + + cin >> in.bin_count; + return in; } -vector bins(bin_count); -double bin_size = (max - min) / bin_count; -for (size_t i = 0; i < number_count; 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; + +void +find_minmax(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; + } } } -if (!found) { -bins[bin_count - 1]++;} + +vector +make_histogram(vector numbers, size_t bin_count) { + vector bins(bin_count); + double min, max; + find_minmax(numbers, min, max); + size_t countt; + + double bin_size = (max - min) / 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; + + } - float procent; - for(size_t i=0; imax_count) + max_count = bins[i]; - cout<MAX_ASTERISK){ + for (size_t j = 0; j <(height = MAX_ASTERISK * (static_cast(bins[i]) / max_count)) ; j++) + { + cout<<"*"; + } + cout<