code: вывод гистрограммы

master
Грудинин Егор 1 год назад
Родитель 90b1ab798f
Сommit b1f93d9454

5
.gitignore поставляемый

@ -0,0 +1,5 @@
/bin
/obj
/*.layout
/*.depend
/*.o

@ -2,71 +2,120 @@
#include <vector> #include <vector>
using namespace std; using namespace std;
int main() {
const size_t SCREEN_WIDTH = 80; struct Input
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; {
vector<double> numbers;
size_t bin_count{};
};
Input
input_data()
{
size_t number_count; size_t number_count;
size_t max_count = 0; cerr << "Enter number count: ";
cerr << "Enter number count:";
cin >> number_count; cin >> number_count;
vector<double> numbers(number_count); Input in;
cerr << "Enter numbers:"; in.numbers.resize(number_count);
for (int i = 0; i < number_count; i++) { for (size_t i = 0; i < number_count; i++)
cin >> numbers[i]; {
cin >> in.numbers[i];
} }
cerr << "Enter bin count: ";
cin >> in.bin_count;
return in;
}
void
size_t bin_count; find_minmax(const vector<double>& numbers, double& min, double& max)
cerr << "Enter bin count:"; {
cin >> bin_count; min = numbers[0];
vector<size_t> bins(bin_count); max = numbers[0];
double min = numbers[0]; for (double x : numbers)
double max = numbers[0]; {
for (double x : numbers) { if (x > max )
if (x < min) { {
min = x;
}
else if (x > max) {
max = x; max = x;
} }
if (x < min)
{
min = x;
}
} }
double bin_size = (max - min) / bin_count; }
for (size_t i = 0; i < number_count; i++) {
vector<size_t>
make_histogram(const vector<double>& numbers, size_t& bin_count)
{
double min = 0;
double max = 0;
find_minmax(numbers, min, max);
auto bin_size = (max - min)/bin_count;
vector<size_t> bins(bin_count);
for (double number : 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 = min + j * bin_size; auto lo = min + j * bin_size;
auto hi = min + (j + 1) * bin_size; auto hi = min + (j + 1) * bin_size;
if ((lo <= numbers[i]) && (numbers[i] < hi)) { if ((lo <= number) && (number < hi))
{
bins[j]++; bins[j]++;
found = true; found = true;
} }
} }
if (!found) { if (!found)
{
bins[bin_count - 1]++; bins[bin_count - 1]++;
} }
for (size_t i = 0; i < bin_count; i++) {
if (bins[i] > max_count) {
max_count = bins[i];
}
}
} }
double kof = double(MAX_ASTERISK) / max_count; return bins;
if (kof > 1) { }
kof = 1;
void
show_histogram_text(const 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 = 0;
for (size_t s = 0; s < bin_count; s++)
{
if (bins[s] > max_count)
{
max_count = bins[s];
}
} }
for (size_t bin : bins) { for (size_t bin : bins)
if (bin < 100) { {
if (bin <100)
{
cout << " "; cout << " ";
} }
if (bin < 10) { if (bin <10)
{
cout << " "; cout << " ";
} }
cout << bin << "|"; cout << bin << "|";
for (size_t i = 0; i < size_t(bin * kof); i++) { if (max_count > MAX_ASTERISK)
cout << "*"; {
size_t count = bin;
size_t height = MAX_ASTERISK * (static_cast<double>(count) / max_count);
for (size_t t = 0; t < height; t++)
{
cout << "*";
}
} }
else for (size_t k = 0; k < bin; k++)
{
cout << "*";
}
cout << endl; cout << endl;
} }
return 0; }
int main()
{
Input in = input_data();
vector<size_t> bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count);
} }

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