Родитель
cb6acd9cb9
Сommit
d98530094c
@ -0,0 +1,117 @@
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
|
||||
|
||||
using namespace std;
|
||||
|
||||
struct Input {
|
||||
vector<double> numbers;
|
||||
size_t bin_count{};
|
||||
size_t number_count{};
|
||||
};
|
||||
|
||||
Input
|
||||
input_data() {
|
||||
Input in;
|
||||
|
||||
size_t number_count;
|
||||
size_t bin_count;
|
||||
|
||||
cerr << "Enter number count: ";
|
||||
cin >> in.number_count;
|
||||
cerr << "Enter bin count: ";
|
||||
cin >> in.bin_count;
|
||||
|
||||
in.numbers.resize(in.number_count);
|
||||
|
||||
for (size_t i = 0; i < in.number_count; i++) {
|
||||
cin >> in.numbers[i];
|
||||
}
|
||||
|
||||
return in;
|
||||
};
|
||||
|
||||
void find_minmax(const vector<double>& 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;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count)
|
||||
{
|
||||
double min, max;
|
||||
find_minmax(numbers, min, max);
|
||||
|
||||
// Ñîçäàíèå êîðçèí äëÿ äàëüíåéøåé ñîðòèðîâêè îöåíîê ïî íèì.
|
||||
|
||||
double bin_size = (max - min) / bin_count;
|
||||
vector<size_t> bins(bin_count);
|
||||
for (size_t i = 0; i < bin_count; i++) {
|
||||
bins[i] = 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 = 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;
|
||||
}
|
||||
|
||||
void show_histogram_text(vector<size_t>& bins, size_t bin_count)
|
||||
{
|
||||
const size_t SCREEN_WIDTH = 80;
|
||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
// Ïîèñê ìàêñèìàëüíîãî êîëè÷åñâà îöåíîê â îäíîì ñòîëáöå.
|
||||
|
||||
size_t max_count = bins[0];
|
||||
|
||||
for (size_t i = 0; i < bin_count; i++)
|
||||
{
|
||||
if (bins[i] > max_count)
|
||||
max_count = bins[i];
|
||||
}
|
||||
|
||||
// Ñîçäàíèå ãèñòîãðàììû ïî îöåíêàì.
|
||||
|
||||
size_t height;
|
||||
|
||||
for (size_t i = 0; i < bin_count; i++) {
|
||||
cout << bins[i] << "|";
|
||||
height = bins[i];
|
||||
if (max_count > MAX_ASTERISK)
|
||||
height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
|
||||
for (size_t j = 1; j <= height; j++)
|
||||
cout << "*";
|
||||
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;
|
||||
}
|
Загрузка…
Ссылка в новой задаче