Вы не можете выбрать более 25 тем
Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.
78 строки
1.7 KiB
C++
78 строки
1.7 KiB
C++
#include <iostream>
|
|
#include <vector>
|
|
#include <cmath>
|
|
#include "histogram.h"
|
|
|
|
using namespace std;
|
|
|
|
void
|
|
find_minmax(const vector<double>& numbers, double& min1, double& max1)
|
|
{
|
|
max1 = numbers[0];
|
|
min1 = numbers[0];
|
|
for(size_t i = 0; i < numbers.size(); i++)
|
|
{
|
|
if (numbers[i] > max1) max1 = numbers[i];
|
|
if (numbers[i] < min1) min1 = numbers[i];
|
|
}
|
|
return;
|
|
}
|
|
|
|
vector<double>
|
|
make_histogram(const vector<double>& numbers, size_t bin_count)
|
|
{
|
|
double min1, max1;
|
|
find_minmax(numbers, min1, max1);
|
|
|
|
vector<double> bins;
|
|
bins.resize(bin_count);
|
|
|
|
size_t cor_size = (max1 - min1)/bin_count;
|
|
|
|
for (size_t i = 0; i < numbers.size(); i++)
|
|
{
|
|
bool flag = false;
|
|
for (size_t j = 0; (j < bin_count) && !flag; j++)
|
|
{
|
|
auto L = min1 + j*cor_size;
|
|
auto H = min1 + (j+1)*cor_size;
|
|
if ((L <= numbers[i]) && (numbers[i] <= H))
|
|
{
|
|
flag = true;
|
|
bins[j]++;
|
|
}
|
|
}
|
|
if (!flag) bins[bin_count-1]++;
|
|
}
|
|
|
|
return bins;
|
|
}
|
|
|
|
void
|
|
show_histogram_text(vector<double> bins, const vector<double>& numbers, size_t bin_count)
|
|
{
|
|
const size_t MAX_ASTERISK = 76;
|
|
size_t maxb = bins[0];
|
|
size_t H, j;
|
|
|
|
for (j = 1; j < bin_count; j++)
|
|
{
|
|
if (bins[j] > maxb) maxb = bins[j];
|
|
}
|
|
|
|
for (j = 0; j < bin_count; j++)
|
|
{
|
|
if (maxb > MAX_ASTERISK)
|
|
{
|
|
H = MAX_ASTERISK * (static_cast<double>(bins[j]) / maxb);
|
|
}
|
|
else H = bins[j];
|
|
if (bins[j] < 100) cout << " ";
|
|
if (bins[j] < 10) cout << " ";
|
|
cout << bins[j] << "|";
|
|
for (size_t i = 0; i < H; i++) cout << "*";
|
|
cout << endl;
|
|
}
|
|
return;
|
|
}
|