DobrovolskaY 1 год назад
Родитель e9aceb1d0c
Сommit 17909b49ef

@ -6,26 +6,34 @@ using namespace std;
const size_t SCREEN_WIDTH = 80; const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 4; const size_t MAX_ASTERISK = SCREEN_WIDTH - 4;
int main() { struct Input {
vector<double> numbers;
size_t bin_count{};
};
Input
input_data() {
size_t number_count; size_t number_count;
cerr << "Enter number count: "; cerr << "Enter number count: ";
cin >> number_count; cin >> number_count;
vector<double> numbers(number_count); Input in;
in.numbers.resize(number_count);
cerr << "Enter massive elements: "; cerr << "Enter massive elements: ";
for (size_t i = 0; i < number_count; i++) { for (size_t i = 0; i < number_count; i++) {
cin >> numbers[i]; cin >> in.numbers[i];
} }
size_t bin_count; in.bin_count; //ÇÀ×ÅÌ
cerr << "Enter bin count: "; cerr << "Enter bin count: ";
cin >> bin_count; cin >> in.bin_count;
return in;
}
vector<size_t> bins(bin_count); void find_minmax(const vector<double>& numbers, double& mini, double& maxi) {
double mini = numbers[0]; mini = numbers[0];
double maxi = numbers[0]; maxi = numbers[0];
for (double x : numbers) { for (double x : numbers) {
if (x < mini) { if (x < mini) {
mini = x; mini = x;
@ -34,14 +42,22 @@ int main() {
maxi = x; maxi = x;
} }
} }
}
vector<size_t>
make_histogram(const vector<double>& numbers, int bin_count) {
double mini, maxi;
find_minmax(numbers, mini, maxi);
vector<size_t> bins(bin_count);
double bin_size = (maxi - mini) / bin_count; double bin_size = (maxi - mini) / bin_count;
for (size_t i = 0; i < number_count; i++) { for (double num : numbers) {
bool found = false; bool found = false;
for (size_t j = 0; (j < bin_count - 1) && !found; j++){ for (size_t j = 0; (j < bin_count - 1) && !found; j++){
auto lo = mini + j * bin_size; auto lo = mini + j * bin_size;
auto hi = mini + (j + 1) * bin_size; auto hi = mini + (j + 1) * bin_size;
if ((lo <= numbers[i]) && (numbers[i] < hi)) { if ((lo <= num) && (num < hi)) {
bins[j]++; bins[j]++;
found = true; found = true;
} }
@ -51,37 +67,45 @@ int main() {
} }
} }
return bins;
}
void show_histogram_text(const vector<size_t>& bins, size_t bin_count) {
size_t max_count = bins[0]; size_t max_count = bins[0];
for (size_t i = 0; i < bin_count; i++) { for (size_t i = 0; i < bin_count; i++) {
if (bins[i]>max_count) { if (bins[i] > max_count) {
max_count = bins[i]; max_count = bins[i];
}
} }
}
vector<size_t> height(bin_count); vector<size_t> height(bin_count);
for (size_t i = 0; i < bin_count; i++) { for (size_t i = 0; i < bin_count; i++) {
if (max_count > MAX_ASTERISK) { if (max_count > MAX_ASTERISK) {
height[i] = round(MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count)); height[i] = round(MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count));
} else { } else {
height[i]=bins[i]; height[i] = bins[i];
} }
} }
for (size_t i = 0; i < bin_count; i++) { for (size_t i = 0; i < bin_count; i++) {
if (bins[i] < 10) { if (bins[i] < 10) {
cout << " "; cout << " ";
} else if (bins[i] < 100) { } else if (bins[i] < 100) {
cout << " "; cout << " ";
} }
cout << bins[i] << "| "; cout << bins[i] << "| ";
for (size_t j = 0; j < height[i]; j++) {
for (size_t j = 0; j<height[i]; j++) { cout << " * ";
cout <<" * ";
} }
cout << endl; cout << endl;
} }
} }
int main() {
auto in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count);
return 0;
}

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