git: добавлены в индекс main.cpp и lab01.cbp

main
LatyshevGI 2 недель назад
Родитель 14bd172c26
Сommit 389e8322b6

@ -33,7 +33,11 @@
<Add option="-fexceptions" />
</Compiler>
<Unit filename=".gitignore" />
<Unit filename="Header.cpp" />
<Unit filename="Header.h" />
<Unit filename="main.cpp" />
<Unit filename="text.cpp" />
<Unit filename="text.h" />
<Extensions>
<lib_finder disable_auto="1" />
</Extensions>

@ -1,159 +1,10 @@
#include <iostream>
#include <vector>
using namespace std;
struct Input {
vector<double> numbers;
size_t bin_count{};
};
Input
input_data() {
size_t number_count, bin_count;
double minl, maxl, bin_size;
cerr << "Enter the number of elements: ";
cin >> number_count;
Input in;
in.numbers.resize(number_count);
vector<double> numbers(number_count);
cerr << "\nEnter " << number_count << " elements:" << endl;
for (size_t i = 0; i < number_count; i++) {
cin >> in.numbers[i];
}
cerr << "Enter the number of bins: ";
cin >> in.bin_count;
return in;
}
void
find_minmax(const vector<double>& numbers, double& minl, double& maxl) {
minl = numbers[0];
maxl = numbers[0];
for (double x : numbers) {
if (x < minl) {
minl = x;
} else {
if (x > maxl) {
maxl = x;
}
}
}
}
vector<size_t>
make_histogram(const vector<double>& numbers, size_t& bin_count) {
double minn, maxn;
find_minmax(numbers, minn, maxn);
double bin_size = (maxn - minn) / bin_count;
vector<size_t> bins(bin_count, 0);
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 = minn + j * bin_size;
auto hi = minn + (j + 1) * bin_size;
if ((numbers[i] >= lo) && (numbers[i] <= hi)) {
bins[j]++;
found = true;
}
}
if (!found) {
bins[bin_count - 1]++;
}
}
return bins;
}
void
show_histogram_text(const vector<size_t> bins, size_t bin_count) {
size_t max_count = bins[0];
for (size_t i = 1; i < bin_count; i++) {
if (bins[i] > max_count) {
max_count = bins[i];
}
}
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
short space_count;
cerr << "\nHistogram:" << endl;
if (max_count <= MAX_ASTERISK) {
for (size_t i = 0; i < bin_count; i++) {
if (bins[i] < 10) {
space_count = 2;
} else if (bins[i] >= 10 && bins[i] < 100) {
space_count = 1;
} else if (bins[i] >= 100 && bins[i] < 1000) {
space_count = 0;
}
for (size_t k = 0; k < space_count; k++) {
cout << " ";
}
cout << bins[i];
cout << "|";
for (size_t j = 0; j < bins[i]; j++) {
cout << "*";
}
cout << "\n";
}
} else {
for (size_t i = 0; i < bin_count; i++) {
if (bins[i] < 10) {
space_count = 2;
} else if (bins[i] >= 10 && bins[i] < 100) {
space_count = 1;
} else if (bins[i] >= 100 && bins[i] < 1000) {
space_count = 0;
}
for (size_t k = 0; k < space_count; k++) {
cout << " ";
}
cout << bins[i];
cout << "|";
size_t height = static_cast<size_t>(MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count));
for (size_t j = 0; j < height; j++) {
cout << "*";
}
cout << "\n";
}
}
}
#include "Header.h"
#include "text.h"
int main() {
auto in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count);
auto bins = make_histogram(in.korz, in.vec);
show_histogram(bins);
return 0;
}

Загрузка…
Отмена
Сохранить