From a45098c05a358d23f3b9ac5a50092fbd3ffa638c Mon Sep 17 00:00:00 2001 From: IvanovDA Date: Mon, 15 Apr 2024 15:53:45 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D0=BE=D0=B1=D0=BD=D0=BE=D0=B2=D0=BB?= =?UTF-8?q?=D0=B5=D0=BD=D0=B8=D0=B5=20=D1=84=D0=B0=D0=B9=D0=BB=D0=B0=20?= =?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 --- cs-project3.cpp | 73 +++++++++++++++++++++++++++++++++++-------------- 1 file changed, 53 insertions(+), 20 deletions(-) diff --git a/cs-project3.cpp b/cs-project3.cpp index 01695b0..60b2df4 100644 --- a/cs-project3.cpp +++ b/cs-project3.cpp @@ -1,35 +1,51 @@ #include #include + using namespace std; -int main() { - const size_t SCREEN_WIDTH = 80; - const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; +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() { + Input in; size_t number_count; - cerr << "Enter amount of numbers \n"; cin >> number_count; - vector numbers(number_count); + in.numbers.resize(number_count); for (size_t i = 0; i < number_count; i++) { - cerr << "Input number " << i + 1 << endl; - cin >> numbers[i]; + cin >> in.numbers[i]; } - double minc, maxc; - minc = maxc = numbers[0]; - for (size_t i = 1; i < number_count; i++) { - if (numbers[i] < minc) { - minc = numbers[i]; + size_t bin_count; + cin >> in.bin_count; + return in; +} + +void +find_minmax(const vector& numbers, double& min, double& max) { + min = numbers[0]; + for (size_t i = 1; i < numbers.size(); i++) { + if (numbers[i] < min) { + min = numbers[i]; } - else if (numbers[i] > maxc) { - maxc = numbers[i]; + else if (numbers[i] > max) { + max = numbers[i]; } } - size_t bin_count; - cerr << "Input number of bins \n"; - cin >> bin_count; +} + +vector +make_histogram(const vector & numbers, size_t bin_count){ + double minc, maxc; + find_minmax(numbers, minc, maxc); vector bins(bin_count); double bin_size = (maxc - minc) / bin_count; size_t bin_max_size = 0; - 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 = minc + j * bin_size; @@ -49,11 +65,22 @@ int main() { } } } + return bins; +} + +void +show_histogram_text(vector bins) { + size_t bin_max_size = 0; + for (auto bin: bins){ + if (bin_max_size < bin){ + bin_max_size = bin; + } + } double k = double(MAX_ASTERISK) / bin_max_size; if (k > 1) { k = 1; } - for (size_t bin = 0; bin < bin_count; bin++) { + for (size_t bin = 0; bin < bins.size(); bin++) { if (bins[bin] < 100) { cout << " "; } @@ -61,10 +88,16 @@ int main() { cout << " "; } cout << bins[bin] << "|"; - for (size_t i = 0; i < bin * k; i++) { + for (size_t i = 0; i < bins[bin] * k; i++) { cout << "*"; } cout << endl; } +} + +int main() { + Input in = input_data(); + auto bins = make_histogram(in.numbers, in.bin_count); + show_histogram_text(bins); return 0; } \ No newline at end of file